Pages that link to "Item:Q1266667"

The following pages link to Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard (Q1266667):

Displaying 50 items.

• Two-stage, single-lot, lot streaming problem for a \(1+2\) hybrid flow shop (Q330269) (← links)
• Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns (Q336423) (← links)
• A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
• Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
• A PTAS for a particular case of the two-machine flow shop with limited machine availability (Q483257) (← links)
• An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
• Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
• Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (Q814116) (← links)
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times (Q850231) (← links)
• Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
• Flowshop scheduling with interstage job transportation (Q892841) (← links)
• Batch scheduling in a two-stage flexible flow shop problem (Q902743) (← links)
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
• Minimizing makespan in two-stage hybrid cross docking scheduling problem (Q1001000) (← links)
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint (Q1009206) (← links)
• A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← links)
• A hybrid two-stage flowshop with part family, batch production, major and minor set-ups (Q1291587) (← links)
• Branch and bound crossed with GA to solve hybrid flowshops (Q1296101) (← links)
• Preemptive job-shop scheduling problems with a fixed number of jobs (Q1299919) (← links)
• The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine (Q1302720) (← links)
• Makespan minimization in preemptive two machine job shops (Q1377264) (← links)
• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
• Local search algorithms for the multiprocessor flow shop scheduling problem (Q1592744) (← links)
• Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage (Q1607975) (← links)
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
• Total completion time minimization in a computer system with a server and two parallel processors (Q1886864) (← links)
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation (Q1887965) (← links)
• Two-stage proportionate flexible flow shop to minimize the makespan (Q1945694) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments (Q2215191) (← links)
• Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage (Q2248262) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Mixed integer linear programming models for flow shop scheduling with a demand plan of job types (Q2303310) (← links)
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
• An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study (Q2337384) (← links)
• A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines (Q2356122) (← links)
• A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages (Q2356251) (← links)
• Optimizing resource speed for two-stage real-time tasks (Q2362234) (← links)
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
• A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
• A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines (Q2456642) (← links)
• Scheduling two-stage hybrid flow shop with availability constraints (Q2496033) (← links)
• An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop (Q2512819) (← links)
• Flexible flow shop scheduling with uniform parallel machines (Q2569085) (← links)
• An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
• Inhomogeneous two-stage systems with precedence constraints. II (Q3980709) (← links)
• Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops (Q4487091) (← links)
• A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
• Preemptive hybrid flowshop scheduling problem of interval orders (Q5956203) (← links)
• A hybrid heuristic approach to master surgery scheduling with downstream resource constraints and dividable operating room blocks (Q6179192) (← links)