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

DOI10.1016/S0377-2217(99)00156-3MaRDI QIDQ1969830zbMATH OpenFDO

Authors Giuseppe Lancia

Publication date 30 January 2001

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

zbMATH Keywords

branch and boundmakespanparallel machinesscheduling theory

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Single-machine scheduling with release times and tails
• Minimizing makespan on parallel machines subject to release dates and delivery times
• Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties

Cites work

• scientific article; zbMATH DE number 3889254 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A new Lagrangian relaxation approach to the generalized assignment problem
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• Batch sizing and job sequencing on a single machine
• Improved Lagrangean decomposition: An application to the generalized assignment problem
• Minimizing maximum lateness on one machine: computational experience and some applications
• On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• The one-machine sequencing problem

Cited in

(10)

• Single-machine scheduling with release times and tails
• An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
• A new approximation algorithm for unrelated parallel machine scheduling with release dates
• Scheduling jobs with release dates and tails on identical machines to minimize the makespan
• Jackson's semi-preemptive scheduling on a single machine
• Novel formulations and logic-based Benders decomposition for the integrated parallel machine scheduling and location problem
• Decomposition methods for the parallel machine scheduling problem with setups
• Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates
• Bicriteria scheduling problem for unrelated parallel machines with release dates
• Minimizing makespan on parallel machines subject to release dates and delivery times

This page was built for publication: Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969830)