Pages that link to "Item:Q1079487"

The following pages link to Some no-wait shops scheduling problems: Complexity aspect (Q1079487):

Displaying 32 items.

• The proportionate two-machine no-wait job shop scheduling problem (Q322845) (← links)
• Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
• A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632) (← links)
• Minimizing total completion time in two-machine flow shops with exact delays (Q1000994) (← links)
• Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
• No-wait shop scheduling: Computational complexity and approximate algorithms (Q1113793) (← links)
• Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
• Two-machine shop scheduling with zero and unit processing times (Q1296097) (← links)
• The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
• Performance of scheduling algorithms for no-wait flowshops with parallel machines (Q1310022) (← links)
• Minimizing makespan in hybrid flowshops (Q1342286) (← links)
• Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. (Q1410327) (← links)
• Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing (Q1584823) (← links)
• On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
• The hot strip mill production scheduling problem: A tabu search approach (Q1609896) (← links)
• Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility (Q1698061) (← links)
• A survey of scheduling problems with no-wait in process (Q1751258) (← links)
• Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines (Q1767900) (← links)
• Two-machine flow shop scheduling problems with no-wait jobs (Q1779704) (← links)
• An efficient algorithm for a job shop problem (Q1897385) (← links)
• A two-machine no-wait flow shop problem with two competing agents (Q2075466) (← links)
• A survey of job shop scheduling problem: the types and models (Q2146994) (← 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)
• An introduction of dominant genes in genetic algorithm for FMS (Q3533197) (← links)
• (Q3585709) (← links)
• The Three-Machine No-Wait Flow Shop is NP-Complete (Q3769960) (← links)
• Modified drum–buffer–rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation (Q5485056) (← links)
• Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays (Q5505680) (← links)
• The non-stop disjoint trajectories problem (Q6564192) (← links)