Some complexity results in cyclic scheduling
From MaRDI portal
Recommendations
- The complexity of scheduling jobs in repetitive manufacturing systems
- The complexity of cyclic shop scheduling problems
- On scheduling cycle shops: Classification, complexity and approximation
- The complexity of cyclic scheduling for identical jobs
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
Cites work
- A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- Compact Cylindrical Chromatic Scheduling
- Cyclic Schedules for Job Shops with Identical Jobs
- Cyclic Scheduling in a Stochastic Environment
- Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
- Flowshop scheduling with limited temporary storage
- scientific article; zbMATH DE number 4209899 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- Minimax algebra
- On cyclic sequence types for constructing cyclic schedules
- On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
- Performance Measures and Schedules in Periodic Job Shops
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Stochastic Analysis of Cyclic Schedules
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
Cited in
(23)- Periodic schedules for linear precedence constraints
- New multi-objective method to solve reentrant hybrid flow shop scheduling problem
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints
- Cyclic scheduling in 3-machine robotic flow shops
- The complexity of scheduling jobs in repetitive manufacturing systems
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound.
- On scheduling cycle shops: Classification, complexity and approximation
- The complexity of cyclic shop scheduling problems
- Chromatic scheduling in a cyclic open shop
- Benders' decomposition for the balancing of assembly lines with stochastic demand
- A cyclic approach to large-scale short-term planning in chemical batch production
- Construction of cyclic schedules in presence of parallel machines
- scientific article; zbMATH DE number 3941255 (Why is no real title available?)
- scientific article; zbMATH DE number 6971075 (Why is no real title available?)
- CROSS cyclic resource-constrained scheduling solver
- Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints
- The complexity of cyclic scheduling for identical jobs
- Cyclic scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule
- Medium term production management for cyclic deliveries
- Moving policies in cyclic assembly line scheduling
- High-multiplicity cyclic job shop scheduling
This page was built for publication: Some complexity results in cyclic scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341404)