Pages that link to "Item:Q1180831"

The following pages link to Permutation vs. non-permutation flow shop schedules (Q1180831):

Displaying 23 items.

• Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
• Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
• General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach (Q497626) (← links)
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
• On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
• A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940) (← links)
• Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
• A computational study of the permutation flow shop problem based on a tight lower bound (Q1777158) (← links)
• Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
• Permutation schedules for a two-machine flow shop with storage (Q1785731) (← links)
• Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256) (← links)
• Shop scheduling problems with pliable jobs (Q2294890) (← links)
• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
• A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking (Q2423281) (← links)
• An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
• Analysis of heuristics for the UET two-machine flow shop problem with time delays (Q2482380) (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
• Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups (Q3163328) (← links)