Pages that link to "Item:Q1266536"
From MaRDI portal
The following pages link to The two-machine total completion time flow shop problem (Q1266536):
Displayed 37 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)
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- An investigation on a two-agent single-machine scheduling problem with unequal release dates (Q339650) (← links)
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951) (← links)
- Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← 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)
- A bicriteria two-machine permutation flowshop problem (Q1296104) (← links)
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
- Generalized pairwise interchanges and machine scheduling (Q1388824) (← links)
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072) (← links)
- Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect (Q1727266) (← links)
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan (Q1787748) (← links)
- A bicriteria approach to the two-machine flow shop scheduling problem (Q1807949) (← 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)
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times (Q2009966) (← links)
- Rescheduling problems with allowing for the unexpected new jobs arrival (Q2125233) (← links)
- Non-clairvoyant weighted flow time scheduling on different multi-processor models (Q2344210) (← links)
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies (Q2356207) (← links)
- The single-machine total tardiness problem with unequal release times and a linear deterioration (Q2511712) (← links)
- A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime (Q3158872) (← links)
- Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246) (← links)
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP (Q5708850) (← links)