Scheduling job classes on uniform machines

DOI10.1016/j.cor.2011.08.004zbMath1251.90146OpenAlexW2068693920MaRDI QIDQ1761112

Enrique Gerstl, Gur Mosheiov

Publication date: 15 November 2012

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

Full work available at URL: https://doi.org/10.1016/j.cor.2011.08.004

zbMATH Keywords

heuristicsschedulingearlinesstardinessuniform machinesminmax

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A multi-agent system for the weighted earliness tardiness parallel machine problem

Uses Software

• NLopt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minmax scheduling with job-classes and earliness-tardiness costs
• Scheduling identical jobs and due-window on uniform machines
• Optimal total-work-content-power due-date determination and sequencing
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
• Due-date assignment on uniform machines
• Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• Scheduling Independent Tasks on Uniform Processors
• The Asymptotic Optimality of the LPT Rule
• Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties
• The parallel machine min-max weighted absolute lateness scheduling problem
• Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs
• Due-date assignment with asymmetric earliness–tardiness cost
• Minmax earliness-tardiness costs with unit processing time jobs
• A common due-data assignment problem on parallel identical machines