Scheduling identical jobs and due-window on uniform machines

DOI10.1016/j.ejor.2009.03.039zbMath1175.90185OpenAlexW2063047053MaRDI QIDQ1038326

Gur Mosheiov, Assaf Sarig

Publication date: 17 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.039

zbMATH Keywords

schedulingearlinesstardinessuniform machinesdue-window

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

A survey on scheduling problems with due windows ⋮ Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times ⋮ Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ Scheduling job classes on uniform machines ⋮ Bicriterion scheduling with a negotiable common due window and resource-dependent processing times

Cites Work

• Determination of common due window location in a single machine scheduling problem
• Due window scheduling for parallel machines
• Earliness-tardiness scheduling problems with a common delivery window
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Due-date assignment on uniform machines
• Common due window size and location determination in a single machine scheduling problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties
• Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
• Due-window assignment with unit processing-time jobs

This page was built for publication: Scheduling identical jobs and due-window on uniform machines