Multiplicity and complexity issues in contemporary production scheduling
DOI10.1111/J.1467-9574.2007.00362.XzbMATH Open1122.90038OpenAlexW2140037720MaRDI QIDQ5422015FDOQ5422015
Authors: Nadia Brauner, Alexander Grigoriev, Joris van de Klundert, Yves Crama 
Publication date: 26 October 2007
Published in: Statistica Neerlandica (Search for Journal in Brave)
Full work available at URL: http://orbi.ulg.ac.be/handle/2268/1710
Recommendations
- A framework for the complexity of high-multiplicity scheduling problems
- Parallel machine scheduling with high multiplicity
- Complexity of scheduling problems with multi-purpose machines
- High Multiplicity in Earliness-Tardiness Scheduling
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- On generating all maximal independent sets
- A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time
- A polynomial algorithm for multiprocessor scheduling with two job lengths.
- Minimizing Service and Operation Costs of Periodic Scheduling
- A framework for the complexity of high-multiplicity scheduling problems
- High Multiplicity in Earliness-Tardiness Scheduling
- Minimizing the number of tardy job units under release time constraints
- Makespan minimization for flow-shop problems with transportation times and a single robot
- Complexity of one-cycle robotic flow-shops
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- On the high multiplicity traveling salesman problem
- The Traveling Salesman Problem with Many Visits to Few Cities
- The maximum deviation just-in-time scheduling problem.
- On polynomial solvability of the high multiplicity total weighted tardiness problem
- Counting and enumeration complexity with application to multicriteria scheduling
- No-wait flow shop scheduling with large lot sizes
Cited In (8)
- A framework for the complexity of high-multiplicity scheduling problems
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem
- Throughput optimization in two-machine flowshops with flexible operations
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
- An alternative approach for proving the NP-hardness of optimization problems
- Identical coupled task scheduling: polynomial complexity of the cyclic case
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- Cyclic lot-sizing problems with sequencing costs
This page was built for publication: Multiplicity and complexity issues in contemporary production scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5422015)
