Due-window assignment with unit processing-time jobs

DOI10.1002/nav.20039zbMath1055.90036OpenAlexW1977880229MaRDI QIDQ4651729

Daniel Oron, Gur Mosheiov

Publication date: 22 February 2005

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20039

zbMATH Keywords

schedulingearliness-tardinessparallel machinesdue-window assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (10)

A survey on scheduling problems with due windows ⋮ Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times ⋮ Soft due window assignment and scheduling of unit-time jobs on parallel machines ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ Due-window assignment problems with unit-time jobs ⋮ An improved algorithm for due-window assignment on parallel identical machines with unit-time jobs ⋮ Scheduling with a common due-window: polynomially solvable cases ⋮ Minmax scheduling problems with a common due-window ⋮ Scheduling identical jobs and due-window on uniform machines ⋮ Scheduling problems with a common due window assignment: A survey

This page was built for publication: Due-window assignment with unit processing-time jobs