Pages that link to "Item:Q922280"

The following pages link to Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation (Q922280):

Displaying 23 items.

• Flow shop non-idle scheduling and resource-constrained scheduling (Q271983) (← links)
• The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
• A simpler and faster algorithm for optimal total-work-content-power due data determination (Q583099) (← links)
• A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
• Lower bounds for minimizing total completion time in a two-machine flow shop (Q880570) (← links)
• A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
• Two machine flow shop scheduling problem with weighted WIP costs (Q954049) (← links)
• Flow shops with WIP and value added costs (Q969753) (← links)
• An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
• The two-machine total completion time flow shop problem (Q1266536) (← links)
• Cellular control of manufacturing systems (Q1309976) (← links)
• A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072) (← links)
• Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
• A bicriteria approach to the two-machine flow shop scheduling problem (Q1807949) (← links)
• Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
• The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime (Q1869720) (← links)
• Two-machine flowshop scheduling with a secondary criterion (Q1870802) (← links)
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm (Q1876196) (← links)
• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
• Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases (Q4645936) (← links)
• Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits (Q6547130) (← links)