Soft due window assignment and scheduling of unit-time jobs on parallel machines

DOI10.1007/s10288-012-0201-4zbMath1261.68034OpenAlexW1964110975WikidataQ57633854 ScholiaQ57633854MaRDI QIDQ1935552

Mikhail Y. Kovalyov, Wladyslaw Janiak, Frank Werner, Adam Janiak

Publication date: 18 February 2013

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-012-0201-4

zbMATH Keywords

schedulingdue windowearliness-tardinessparallel machinesunit-time jobs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time, A survey on scheduling problems with due windows, Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine, 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, Bicriterion scheduling with a negotiable common due window and resource-dependent processing times, Minmax scheduling and due-window assignment with position-dependent processing times and job rejection, Due-window assignment with identical jobs on parallel uniform machines

Cites Work

• A column generation algorithm for the vehicle routing problem with soft time windows
• On scheduling around large restrictive common due windows
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
• Optimal common due-date with limited completion time deviation
• Due window scheduling for parallel machines
• Maximizing the weighted number of on-time jobs in single machine scheduling with time windows
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Scheduling with a common due-window: polynomially solvable cases
• An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Due-window assignment with unit processing-time jobs
• An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
• Recent progress of local search in handling the time window constraints of the vehicle routing problem