Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs

DOI10.1016/j.ins.2012.10.024zbMath1293.90026MaRDI QIDQ2510197

Adam Janiak, Wladyslaw Janiak, Erhan Kozan, Mikhail Y. Kovalyov, Erwin Pesch

Publication date: 1 August 2014

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2012.10.024

zbMATH Keywords

scheduling; parallel machine; earliness/tardiness; due window assignment

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

A new perspective on single-machine scheduling problems with late work related criteria, Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window, A new constraint programming approach for optimising a coal rail system, Single machine group scheduling with time dependent processing times and ready times, Due-window assignment scheduling in the proportionate flow shop setting, Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect, Bicriterion scheduling with a negotiable common due window and resource-dependent processing times, Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries, Just-in-time scheduling for a distributed concrete precast flow shop system, Tackling Common Due Window Problem with a Two-Layered Approach