On scheduling around large restrictive common due windows
From MaRDI portal
Publication:704121
DOI10.1016/J.EJOR.2003.10.026zbMATH Open1065.90033OpenAlexW2059067336MaRDI QIDQ704121FDOQ704121
Authors: Dirk Biskup, Martin Feldmann 
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
Recommendations
- Single-machine scheduling with a common due window
- Scheduling problems with a common due window assignment: a survey
- Common due window size and location determination in a single machine scheduling problem
- scientific article; zbMATH DE number 7448659
- Earliness-tardiness scheduling problems with a common delivery window
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Title not available (Why is that?)
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Evolution strategies. A comprehensive introduction
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- Title not available (Why is that?)
- Scheduling around a small common due date
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
- Common due window size and location determination in a single machine scheduling problem
- Sequencing with Earliness and Tardiness Penalties: A Review
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Single-machine scheduling with a common due window
- Parallel machine scheduling with a common due window
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
- Optimal common due-date with limited completion time deviation
- Minimizing the average deviation of job completion times about a common due date
- Due window scheduling for parallel machines
- Determination of common due window location in a single machine scheduling problem
- Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Single Machine Scheduling with a Common Delivery Window
- The no free lunch theorems: complexity and security
- Optimal common due-date with limited completion time
Cited In (9)
- Tackling common due window problem with a two-layered approach
- Permutation flow shop scheduling with earliness and tardiness penalties
- Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window
- Due-window assignment scheduling problem with stochastic processing times
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Minmax scheduling problems with a common due-window
- A survey on scheduling problems with due windows
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
- Soft due window assignment and scheduling of unit-time jobs on parallel machines
Uses Software
This page was built for publication: On scheduling around large restrictive common due windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704121)
