Pages that link to "Item:Q4248937"

The following pages link to The open shop scheduling problem with a given sequence of jobs on one machine (Q4248937):

Displaying 16 items.

• Relocation scheduling subject to fixed processing sequences (Q282245) (← links)
• Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence (Q435728) (← links)
• Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence (Q490158) (← links)
• Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times (Q1025256) (← links)
• The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323) (← links)
• Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines (Q1651647) (← links)
• Single-machine scheduling with supporting tasks (Q1751119) (← links)
• Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type (Q1944074) (← 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)
• Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence (Q2400438) (← links)
• Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
• Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
• (Q3033546) (← links)
• A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment (Q6635995) (← links)