Pages that link to "Item:Q3991317"

The following pages link to The Lessons of Flowshop Scheduling Research (Q3991317):

Displaying 34 items.

• New hard benchmark for flowshop scheduling problems minimising makespan (Q300036) (← links)
• On optimizing a bi-objective flowshop scheduling problem in an uncertain environment (Q356401) (← links)
• Algorithms for a realistic variant of flowshop scheduling (Q732880) (← links)
• Looking ahead with the pilot method (Q816423) (← links)
• Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times (Q878582) (← links)
• Modeling realistic hybrid flexible flowshop scheduling problems (Q941540) (← links)
• Architecture of manufacturing scheduling systems: literature review and an integrated proposal (Q976436) (← links)
• Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times (Q1025256) (← links)
• Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
• Modified simulated annealing algorithms for the flow shop sequencing problem (Q1129912) (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
• Variants of the two machine flow shop problem connected with factorization of matrix functions (Q1278197) (← links)
• Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
• Comparison of iterative improvement techniques for schedule optimization (Q1278321) (← links)
• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem (Q1278537) (← links)
• Two-machine flowshop scheduling with availability constraints (Q1296377) (← links)
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint (Q1362517) (← links)
• Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
• Constructing a fuzzy flow-shop sequencing model based on statistical data (Q1603300) (← links)
• Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines (Q1651647) (← links)
• A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
• Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
• Frameworks for adaptable scheduling algorithms (Q1976517) (← links)
• The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time (Q2468768) (← links)
• Flowshop scheduling research after five decades (Q2572844) (← links)
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility (Q2572852) (← links)
• A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows (Q2673560) (← links)
• A new lower bounding rule for permutation flow shop scheduling (Q2766112) (← links)
• A modification to the CGPS algorithm for three-machine flow shop scheduling (Q2766119) (← links)
• Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness (Q2958669) (← links)