On scheduling cycle shops: Classification, complexity and approximation
From MaRDI portal
Publication:1600002
DOI10.1002/jos.95zbMath1024.90041OpenAlexW2143293078MaRDI QIDQ1600002
Martin Middendorf, Timkovsky, Vadim G.
Publication date: 27 July 2003
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://ul.qucosa.de/id/qucosa%3A32026
Related Items (11)
Converging to periodic schedules for cyclic scheduling problems with resources and deadlines ⋮ Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints ⋮ Scheduling in reentrant robotic cells: algorithms and complexity ⋮ Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. ⋮ A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule ⋮ Complexity results for weighted timed event graphs ⋮ Semi-transitive orientations and word-representable graphs ⋮ High-multiplicity cyclic job shop scheduling ⋮ Throughput-optimal sequences for cyclically operated plants ⋮ Alternation Graphs ⋮ Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- V-shop scheduling
- Preemptive scheduling to minimize mean weighted flow time
- Some no-wait shops scheduling problems: Complexity aspect
- Complexity results for scheduling chains on a single machine
- NP-complete scheduling problems
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints
- Total completion time minimization in two-machine job shops with unit-time operations
- An improved algorithm for cyclic flowshop scheduling in a robotic cell
- A heuristic algorithm for two-machine re-entrant shop scheduling
- Scheduling in robotic cells: Complexity and steady state analysis
- Scheduling of parts and robot activities in a two machine robotic cell
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- Some complexity results in cyclic scheduling
- A study of the cyclic scheduling problem on parallel processors
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
- A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
- Is a unit-job shop not easier than identical parallel machines?
- A new approximation algorithm for UET-scheduling with chain-type precedence constraints.
- Scheduling no-wait robotic cells with two and three machines
- Cyclic scheduling in robotic flowshops
- On the complexity of minimizing the number of late jobs in unit time open shop
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
- Complexity results for single-machine problems with positive finish-start time-lags
- A Mathematical Model for Periodic Scheduling Problems
- Optimization of multistage cyclic service of a production line by a transmanipulator
- Deterministic Scheduling with Pipelined Processors
- Minimizing Total Tardiness on a Single Machine with Precedence Constraints
- Cyclic Schedules for Job Shops with Identical Jobs
- Complexity of Scheduling under Precedence Constraints
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- Computational Complexity of Discrete Optimization Problems
- Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
- Performance Measures and Schedules in Periodic Job Shops
- Cyclic Scheduling of Identical Parts in a Robotic Cell
- Minimizing Makespan in a Class of Reentrant Shops
- Makespan minimization for flow-shop problems with transportation times and a single robot
This page was built for publication: On scheduling cycle shops: Classification, complexity and approximation
