Minimizing maximum earliness on parallel identical machines

DOI10.1016/S0305-0548(99)00103-3MaRDI QIDQ5926601zbMATH OpenOpenAlexFDO

Authors Micha Mandel, Gur Mosheiov

Publication date 13 May 2001

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0305-0548(99)00103-3

zbMATH Keywords

earlinessheuristicslatenessparallel machinesscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Minmax scheduling with job-classes and earliness-tardiness costs
• Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
• Due-date assignment and early/tardy scheduling on identical parallel machines
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties

Cites work

• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• An Algorithm for Minimizing the Range of Lateness on a Single Machine
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Improved Bounds for the Range of Lateness on a Single Machine
• Minimizing the Range of Lateness on a Single Machine
• On a New Class of Combinatoric Optimizers for Multi-Product Single-Machine Scheduling
• Reducibility among combinatorial problems

Cited in

(4)

• Improved algorithms to minimize workload balancing criteria on identical parallel machines
• Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system

This page was built for publication: Minimizing maximum earliness on parallel identical machines

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