Scheduling with a common due-window: polynomially solvable cases

DOI10.1016/j.ins.2009.11.042zbMath1182.90047OpenAlexW2029740381MaRDI QIDQ2269806

Gur Mosheiov, Assaf Sarig

Publication date: 11 March 2010

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

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

zbMATH Keywords

linear programmingschedulingearliness-tardiness costcommon due-window

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

A survey on scheduling problems with due windows ⋮ Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration ⋮ Soft due window assignment and scheduling of unit-time jobs on parallel machines ⋮ Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection ⋮ Scheduling problems with a common due window assignment: A survey

Cites Work

• Unnamed Item
• 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 note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Common due window size and location determination in a single machine scheduling problem
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem
• On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• The parallel machine min-max weighted absolute lateness scheduling problem
• Due-window assignment with unit processing-time jobs
• Due-date assignment with asymmetric earliness–tardiness cost
• Minmax earliness-tardiness costs with unit processing time jobs