Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs

DOI<287::AID-NAV4>3.0.CO;2-4 10.1002/(SICI)1520-6750(199704)44:3<287::AID-NAV4>3.0.CO;2-4zbMath0890.90100OpenAlexW2034026395MaRDI QIDQ4367301

Awi Federgruen, Gur Mosheiov

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199704)44:3<287::aid-nav4>3.0.co;2-4

zbMATH Keywords

parallel machinesworst-case boundsmaximum earliness or tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach ⋮ Minmax scheduling with job-classes and earliness-tardiness costs ⋮ Scheduling job classes on uniform machines ⋮ Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey ⋮ A note on a due-date assignment on a two-machine flow-shop ⋮ Minmax earliness-tardiness costs with unit processing time jobs ⋮ A common due-data assignment problem on parallel identical machines ⋮ Parallel machine scheduling with a common due window ⋮ Hierarchical production planning and scheduling in a multi-product, batch process environment ⋮ Due-date assignment on uniform machines

This page was built for publication: Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs