Minimizing maximum earliness on parallel identical machines

DOI10.1016/S0305-0548(99)00103-3zbMath0985.90040OpenAlexW1999430502MaRDI QIDQ5926601

Gur Mosheiov, Micha Mandel

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

heuristicsschedulingearlinesslatenessparallel machines

Mathematics Subject Classification ID

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

Cites Work

• An Algorithm for Minimizing the Range of Lateness on a Single Machine
• Minimizing the Range of Lateness on a Single Machine
• Improved Bounds for the Range of Lateness on a Single Machine
• Reducibility among Combinatorial Problems
• On a New Class of Combinatoric Optimizers for Multi-Product Single-Machine Scheduling
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item