Pages that link to "Item:Q1607980"
From MaRDI portal
The following pages link to The complexity of cyclic shop scheduling problems (Q1607980):
Displaying 32 items.
- A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670) (← links)
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule (Q633540) (← links)
- Medium term production management for cyclic deliveries (Q655196) (← links)
- Throughput-optimal sequences for cyclically operated plants (Q732253) (← links)
- V-shop scheduling (Q795725) (← links)
- Tabu search algorithms for cyclic machine scheduling problems (Q880506) (← links)
- On the connection between a cyclic job shop and a reentrant flow shop scheduling problem (Q880555) (← links)
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
- High-multiplicity cyclic job shop scheduling (Q957353) (← links)
- An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
- The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (Q1319564) (← links)
- Some complexity results in cyclic scheduling (Q1341404) (← links)
- Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
- Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. (Q1400347) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Open shop scheduling with synchronization (Q1702656) (← links)
- Open shop cyclic scheduling (Q1750495) (← links)
- Chromatic scheduling in a cyclic open shop (Q1767677) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- Cyclic flow-shop scheduling with no-wait constraints and missing operations (Q2140312) (← links)
- A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
- Job-shop scheduling in a body shop (Q2434313) (← links)
- Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints (Q2467264) (← links)
- Cyclic hoist scheduling in large real-life electroplating lines (Q2642305) (← links)
- Construction of cyclic schedules in presence of parallel machines (Q2984968) (← links)
- (Q3358512) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- Performance Measures and Schedules in Periodic Job Shops (Q4367266) (← links)
- Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints (Q5090138) (← links)
- (Q5206679) (← links)