Pages that link to "Item:Q2884499"
From MaRDI portal
The following pages link to Scheduling batches with sequential job processing for two-machine flow and open shops (Q2884499):
Displaying 27 items.
- A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (Q398896) (← links)
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (Q435728) (← links)
- Batch scheduling on two-machine flowshop with machine-dependent setup times (Q606172) (← links)
- Batching decisions for assembly production systems (Q703918) (← links)
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- Model approximation for batch flow shop scheduling with fixed batch sizes (Q896496) (← links)
- Batching and scheduling in a multi-machine flow shop (Q954247) (← links)
- Scheduling incompatible tasks on two machines (Q1042485) (← links)
- Approximation algorithms for two-machine flow shop scheduling with batch setup times (Q1290646) (← links)
- Flow shop and open shop scheduling with a critical machine and two operations per job (Q1590807) (← links)
- Two-machine flowshop batching and scheduling (Q1772969) (← links)
- Complexity of flow shop scheduling problems with transportation constraints (Q1887768) (← links)
- Solving the serial batching problem in job shop manufacturing systems (Q1926815) (← links)
- Scheduling with batching: A review (Q1969826) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Open-shop batch scheduling with identical jobs (Q2467272) (← links)
- Two-machine shop scheduling: Compromise between flexibility and makespan value (Q2566711) (← links)
- A bicriteria flow-shop scheduling problem with two serial batching machines (Q2861549) (← links)
- Batch scheduling on a two-machine jobshop with machine-dependent setup times (Q2892129) (← links)
- No-Wait Scheduling Problems with Batching Machines (Q2958672) (← links)
- Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
- AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER (Q3444847) (← links)
- Transporting jobs through a two‐machine open shop (Q3621908) (← links)
- Scheduling batches with simultaneous job processing for two-machine shop problems (Q5932282) (← links)
