Scheduling on uniform parallel machines to minimize maximum lateness

DOI10.1016/S0167-6377(00)00018-3zbMath0971.90035WikidataQ126570256 ScholiaQ126570256MaRDI QIDQ1577473

Christos P. Koulamas, Kyparisis, George J.

Publication date: 22 November 2000

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

schedulingparallel machinesworst-case analysisapproximation/heuristic

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36)

Related Items

Makespan minimization on uniform parallel machines with release times ⋮ Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines ⋮ A note on worst-case performance of heuristics for maintenance scheduling problems ⋮ A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ A simulated annealing approach to minimize the maximum lateness on uniform parallel machines ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing ⋮ Flexible flow shop scheduling with uniform parallel machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Bounds for naive multiple machine scheduling with release times and deadlines
• SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/L_<MAX> AND n/2/F/L_<MAX> SCHEDULING PROBLEMS
• Bounds for List Schedules on Uniform Processors