Pages that link to "Item:Q1310021"
From MaRDI portal
The following pages link to The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021):
Displayed 19 items.
- Modified characteristics projection finite element method for time-dependent conduction-convection problems (Q283491) (← links)
- A mixed integer programming model for the cyclic job-shop problem with transportation (Q442206) (← links)
- Medium term production management for cyclic deliveries (Q655196) (← links)
- Sequencing and scheduling in robotic cells: recent developments (Q880509) (← links)
- Two machine flow shop scheduling problem with weighted WIP costs (Q954049) (← links)
- An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
- Flow shops with WIP and value added costs (Q969753) (← links)
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints (Q1278237) (← links)
- Sequencing jobs for an automated manufacturing module with buffer (Q1278543) (← links)
- An improved algorithm for cyclic flowshop scheduling in a robotic cell (Q1278650) (← links)
- The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
- Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. (Q1400347) (← links)
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing (Q1584823) (← links)
- The complexity of cyclic shop scheduling problems (Q1607980) (← links)
- Scheduling in network flow shops (Q2564878) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Construction of cyclic schedules in presence of parallel machines (Q2984968) (← links)
- Declarative Modeling for Multimodal Processes Driven Distribution Networks (Q5049404) (← links)
- Timed event graph-based cyclic reconfigurable flow shop modelling and optimization (Q5444453) (← links)