Scheduling: Theory and ApplicationsChung-Yee Lee, Lei Lei |
Contents
Preemptive multiprocessor task scheduling with release times and time windows | 34 |
Complexity of scheduling problems with multipurpose machines | 57 |
Single machine scheduling with batch setup times to minimize maximum lateness | 75 |
Copyright | |
18 other sections not shown
Common terms and phrases
applied assignment b₁ batch beam search branch and bound buffer Cmax completion computational confidence level consider constraints cost customer order cycle decision defined denote due date dynamic programming example feasible schedule fixed formulation genetic algorithm given graph heuristic idle improvement instance integer interface iterations job class job shop scheduling job-shop problem job-shop scheduling problem K₁ linear programming Lmax lower bound machine scheduling makespan maximum method minimize Multi-PCP multiprocessor n₁ n₂ neighbourhood NP-complete NP-hard number of jobs objective function obtained Operations Research optimal schedule optimal solution paper parameter part-timers performance PMFRS problem pmtn polynomial processing processors production R-jobs r₁ resource S₁ search procedure search techniques setup simulated annealing single machine solved step strongly NP-hard subproblems subprocedure system makespan tabu list tabu search tardiness tasks test problems theorem traveling salesman problem window