Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan

DOI10.1016/S0377-2217(99)00156-3zbMath0953.90029MaRDI QIDQ1969830

Giuseppe Lancia

Publication date: 30 January 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

parallel machines; branch and bound; scheduling theory; makespan

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates, Jackson's semi-preemptive scheduling on a single machine, Minimizing makespan on parallel machines subject to release dates and delivery times, Decomposition Methods for the Parallel Machine Scheduling Problem with Setups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Batch sizing and job sequencing on a single machine
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• A new Lagrangian relaxation approach to the generalized assignment problem
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• The one-machine sequencing problem
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Minimizing maximum lateness on one machine: computational experience and some applications