Pages that link to "Item:Q3769960"

The following pages link to The Three-Machine No-Wait Flow Shop is NP-Complete (Q3769960):

Displaying 50 items.

• A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
• Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
• Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
• Scheduling two-machine no-wait open shops to minimize makespan (Q707009) (← links)
• Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) (← links)
• New directions in scheduling theory (Q786649) (← links)
• Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
• On no-wait and no-idle flow shops with makespan criterion (Q859679) (← links)
• Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time (Q861201) (← links)
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
• Predictive-reactive scheduling for single surgical suite subject to random emergency surgery (Q887886) (← links)
• A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems (Q1010312) (← links)
• Some no-wait shops scheduling problems: Complexity aspect (Q1079487) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Small and large TSP: Two polynomially solvable cases of the traveling salesman problem (Q1309942) (← links)
• The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
• Two-stage no-wait scheduling models with setup and removal times separated (Q1374028) (← links)
• Scheduling no-wait robotic cells with two and three machines (Q1569933) (← links)
• A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups (Q1577472) (← links)
• Nonpreemptive flowshop scheduling with machine dominance (Q1604067) (← links)
• Flow shop scheduling with flexible processing times (Q1621840) (← links)
• Three-machine flow shop scheduling with overlapping waiting time constraints (Q1628045) (← links)
• No-wait or no-idle permutation flowshop scheduling with dominating machines (Q1767400) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds (Q1804883) (← links)
• Complexity of flow shop scheduling problems with transportation constraints (Q1887768) (← links)
• Lot sizing in a no-wait flow shop (Q1904756) (← links)
• No-wait two-stage flowshop problem with multi-task flexibility of the first machine (Q2054067) (← links)
• Benders decomposition for the mixed no-idle permutation flowshop scheduling problem (Q2197331) (← links)
• \(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources (Q2241156) (← links)
• Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
• Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm (Q2289017) (← links)
• No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957) (← links)
• On Eulerian extensions and their application to no-wait flowshop scheduling (Q2434285) (← links)
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
• An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops (Q2482377) (← links)
• A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
• Evolutionary hybrid particle swarm optimization algorithm for solving NP-hard no-wait flow shop scheduling problems (Q2633191) (← links)
• Scheduling in supply chain environment (Q2643925) (← links)
• A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
• No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (Q2800373) (← links)
• New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness (Q3055285) (← links)
• (Q3358512) (← links)
• SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS (Q3434279) (← links)
• (Q4239706) (← links)
• Scheduling for parallel dedicated machines with a single server (Q4488782) (← links)
• Permutation, no-wait, no-idle flow shop problems (Q4971620) (← links)
• Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs (Q5058931) (← links)
• Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
• Part sequencing in three-machine no-wait robotic cells (Q5929148) (← links)