Pages that link to "Item:Q1607980"
From MaRDI portal
The following pages link to The complexity of cyclic shop scheduling problems (Q1607980):
Displaying 17 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)
- 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)
- Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. (Q1400347) (← links)
- Open shop cyclic scheduling (Q1750495) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← 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)
- Complexity of cyclic job shop scheduling problems for identical jobs with no-wait constraints (Q5090138) (← links)
