Pages that link to "Item:Q1604072"
From MaRDI portal
The following pages link to An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072):
Displayed 26 items.
- Flow shop non-idle scheduling and resource-constrained scheduling (Q271983) (← links)
- An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
- An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← links)
- A two-machine flowshop problem with two agents (Q709115) (← links)
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← 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)
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
- Flow shops with WIP and value added costs (Q969753) (← links)
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem (Q1848361) (← 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)
- A global constraint for total weighted completion time for unary resources (Q2430362) (← links)
- The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time (Q2475853) (← links)
- A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times (Q2572851) (← links)
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP (Q5708850) (← links)
- Parameter less hybrid IG-Jaya approach for permutation flow shop scheduling problem (Q6065188) (← links)
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)