The two-machine total completion time flow shop problem
From MaRDI portal
Recommendations
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Two-machine flowshop scheduling with a secondary criterion
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
Cites work
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1263270 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- The auction algorithm: A distributed relaxation method for the assignment problem
- Two-machine flowshop scheduling to minimize mean flow time
Cited in
(57)- Time complexity and linear-time approximation of the ancient two-machine flow shop
- A bicriteria two-machine permutation flowshop problem
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- Generalized pairwise interchanges and machine scheduling
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan
- A bicriteria approach to the two-machine flow shop scheduling problem
- The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
- Two-machine flowshop scheduling with a secondary criterion
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- Rescheduling problems with allowing for the unexpected new jobs arrival
- Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect
- Non-clairvoyant weighted flow time scheduling on different multi-processor models
- A cyclical search for the two machine flow shop and open shop to minimise finishing time
- The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
- The single-machine total tardiness problem with unequal release times and a linear deterioration
- Exact solution of the two-machine flow shop problem with three operations
- Flow shop non-idle scheduling and resource-constrained scheduling
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases
- An effective differential evolution algorithm for permutation flow shop scheduling problem
- scientific article; zbMATH DE number 425580 (Why is no real title available?)
- Minimising makespan in the two-machine flow-shop with release times
- A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
- An assignment-based lower bound for a class of two-machine flow shop problems
- Optimizing blocking flow shop scheduling problem with total completion time criterion
- A tabu method for a two-agent single-machine scheduling with deterioration jobs
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
- Some properties of the total flow-time problem of two machine open-shop
- scientific article; zbMATH DE number 3908146 (Why is no real title available?)
- The two-machine permutation flow shop with state-dependent processing times
- scientific article; zbMATH DE number 1319608 (Why is no real title available?)
- scientific article; zbMATH DE number 502872 (Why is no real title available?)
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
- Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Inverse scheduling: Two-machine flow-shop problem
- A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
- A two-machine flowshop problem with two agents
- A matheuristic approach for the two-machine total completion time flow shop problem
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Lower bounds for minimizing total completion time in a two-machine flow shop
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- A bicriteria flowshop scheduling with a learning effect
- Two machine flow shop scheduling problem with weighted WIP costs
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- Flow shops with WIP and value added costs
This page was built for publication: The two-machine total completion time flow shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266536)
