On scheduling around large restrictive common due windows

DOI10.1016/j.ejor.2003.10.026zbMath1065.90033OpenAlexW2059067336MaRDI QIDQ704121

Martin Feldmann, Dirk Biskup

Publication date: 12 January 2005

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

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

zbMATH Keywords

SchedulingMappingCommon due windowMeta-heuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

A survey on scheduling problems with due windows ⋮ Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection ⋮ Soft due window assignment and scheduling of unit-time jobs on parallel machines ⋮ Tackling Common Due Window Problem with a Two-Layered Approach ⋮ Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window ⋮ Permutation flow shop scheduling with earliness and tardiness penalties ⋮ Due-window assignment scheduling problem with stochastic processing times ⋮ Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times

Uses Software

• OR-Library
• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal common due-date with limited completion time
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Optimal common due-date with limited completion time deviation
• Scheduling around a small common due date
• 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
• Optimal common due-date with completion time tolerance
• A single machine scheduling problem with common due window and controllable processing times
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
• Guidelines for the use of meta-heuristics in combinatorial optimization.
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Evolution strategies. A comprehensive introduction
• Common due window size and location determination in a single machine scheduling problem
• Minimizing the average deviation of job completion times about a common due date
• Sequencing with Earliness and Tardiness Penalties: A Review
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
• Single Machine Scheduling with a Common Delivery Window
• The no free lunch theorems: complexity and security
• Single-machine scheduling with a common due window
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
• Parallel machine scheduling with a common due window

This page was built for publication: On scheduling around large restrictive common due windows