Pages that link to "Item:Q596459"
From MaRDI portal
The following pages link to Scheduling three-operation jobs in a two-machine flow shop to minimize makespan (Q596459):
Displaying 16 items.
- Minimizing makespan in three-machine flow shops with deteriorating jobs (Q340257) (← links)
- A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
- Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times (Q706971) (← links)
- Synchronous flow shop scheduling with pliable jobs (Q723997) (← links)
- Throughput optimization in two-machine flowshops with flexible operations (Q983633) (← links)
- Flow shop scheduling with flexible processing times (Q1621840) (← links)
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Shop scheduling problems with pliable jobs (Q2294890) (← links)
- Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence (Q2400438) (← links)
- Some results of the worst-case analysis for flow shop scheduling with a learning effect (Q2449373) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Exact solution of the two-machine flow shop problem with three operations (Q2669696) (← links)
- Makespan minimization on three-machine flow shop with deteriorating jobs (Q2873830) (← links)
- TWO-AND THREE-MACHINE FLOW-SHOP MAKESPAN SCHEDULING PROBLEMS WITH ADDITIONAL TIMES SEPARATED FROM PROCESSING TIMES (Q3703568) (← links)
- A three-agent scheduling problem for minimizing the flow time on two machines (Q5109775) (← links)
