A framework for the complexity of high-multiplicity scheduling problems
From MaRDI portal
Publication:2569171
DOI10.1007/s10878-005-1414-7zbMath1079.90049OpenAlexW1999832757WikidataQ57338967 ScholiaQ57338967MaRDI QIDQ2569171
Joris van de Klundert, Alexander Grigoriev, Nadia Brauner, Yves Cramer
Publication date: 18 October 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://orbi.ulg.ac.be/handle/2268/1721
Related Items (23)
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 ⋮ High-multiplicity scheduling on one machine with forbidden start and completion times ⋮ Simultaneous optimization of classical objectives in JIT scheduling ⋮ Response time variability ⋮ Perfect periodic scheduling for three basic cycles ⋮ Scheduling and fixed-parameter tractability ⋮ Identical coupled task scheduling: polynomial complexity of the cyclic case ⋮ The maximum deviation just-in-time scheduling problem. ⋮ Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem ⋮ Identical part production in cyclic robotic cells: Concepts, overview and open questions ⋮ Multiplicity and complexity issues in contemporary production scheduling ⋮ Modeling and solving the periodic maintenance problem ⋮ Throughput optimization in two-machine flowshops with flexible operations ⋮ Scheduling with periodic availability constraints and irregular cost functions ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times ⋮ High Multiplicity Scheduling with Switching Costs for Few Products ⋮ Shop scheduling problems with pliable jobs ⋮ Many-visits TSP revisited ⋮ Single machine scheduling with forbidden start times ⋮ Cyclic lot-sizing problems with sequencing costs ⋮ Exact and approximate algorithms for high-multiplicity parallel machine scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing the number of tardy job units under release time constraints
- On generating all maximal independent sets
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- On polynomial solvability of the high multiplicity total weighted tardiness problem
- Scheduling chains on a single machine with non-negative time lags
- Complexity of one-cycle robotic flow-shops
- The maximum deviation just-in-time scheduling problem.
- A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
- The Traveling Salesman Problem with Many Visits to Few Cities
- The Complexity of Vertex Enumeration Methods
- A Note on “Level Schedules for Mixed-Model Assembly Lines in Just-in-Time Production Systems”
- Level Schedules for Mixed-Model Assembly Lines in Just-In-Time Production Systems
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Level Schedules for Mixed-Model, Just-in-Time Processes
- High Multiplicity in Earliness-Tardiness Scheduling
- Minimizing Service and Operation Costs of Periodic Scheduling
- Parallel machine scheduling with high multiplicity
- Makespan minimization for flow-shop problems with transportation times and a single robot
This page was built for publication: A framework for the complexity of high-multiplicity scheduling problems
