On scheduling around large restrictive common due windows
type: Item
instance of: scholarly article
title: On scheduling around large restrictive common due windows
zbMATH Open document ID: 1065.90033
author: Dirk Biskup
author: Martin Feldmann
published in: European Journal of Operational Research
publication date: 2005-01-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2127052
zbMATH Keywords: Scheduling
zbMATH Keywords: Common due window
zbMATH Keywords: Mapping
zbMATH Keywords: Meta-heuristic
describes a project that uses: Genocop
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.ejor.2003.10.026
OpenAlex ID: W2059067336
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Evolution strategies. A comprehensive introduction
cites work: Q4869775
cites work: Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
cites work: Parallel machine scheduling with a common due window
cites work: Optimal common due-date with limited completion time deviation
cites work: Optimal common due-date with limited completion time
cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
cites work: Q4692508
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
cites work: Guidelines for the use of meta-heuristics in combinatorial optimization.
cites work: The no free lunch theorems: complexity and security
cites work: Scheduling around a small common due date
cites work: Minimizing the average deviation of job completion times about a common due date
cites work: Due window scheduling for parallel machines
cites work: Earliness-tardiness scheduling problems with a common delivery window
cites work: Determination of common due window location in a single machine scheduling problem
cites work: A single machine scheduling problem with common due window and controllable processing times
cites work: Common due window size and location determination in a single machine scheduling problem
cites work: A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
cites work: Q4873721
cites work: Q3157878
cites work: Survey Paper—Time Window Constrained Routing and Scheduling Problems
cites work: Single Machine Scheduling with a Common Delivery Window
cites work: Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
cites work: Optimal common due-date with completion time tolerance
cites work: Q4350037
cites work: Single-machine scheduling with a common due window
DOI: 10.1016/J.EJOR.2003.10.026
description: scientific article; zbMATH DE number 2127052