The two-machine total completion time flow shop problem
From MaRDI portal
Publication:1266536
DOI10.1016/0377-2217(95)00351-7zbMath0916.90148OpenAlexW2063552989MaRDI QIDQ1266536
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00351-7
branch-and-boundlower boundsneighborhood searchtotal completion timetwo-machine flow shopNP-hard scheduling
Related Items (42)
Flow shop non-idle scheduling and resource-constrained scheduling ⋮ The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm ⋮ A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime ⋮ Rescheduling problems with allowing for the unexpected new jobs arrival ⋮ An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications ⋮ 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 ⋮ Minimizing total completion time in a two-machine flow shop with deteriorating jobs ⋮ The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ An assignment-based lower bound for a class of two-machine flow shop problems ⋮ 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 ⋮ Lower bounds for minimizing total completion time in a two-machine flow shop ⋮ Generalized pairwise interchanges and machine scheduling ⋮ 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 ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect ⋮ Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect ⋮ 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 SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP ⋮ 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 ⋮ A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function ⋮ Flow shops with WIP and value added costs ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ A two-machine flowshop problem with two agents ⋮ Re-entrant flowshop scheduling with learning considerations to minimize the makespan ⋮ The single-machine total tardiness problem with unequal release times and a linear deterioration ⋮ A matheuristic approach for the two-machine total completion time flow shop problem ⋮ A bicriteria approach to the two-machine flow shop scheduling problem ⋮ A robust two-machine flow-shop scheduling model with scenario-dependent processing times ⋮ A bicriteria two-machine permutation flowshop problem ⋮ Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm ⋮ Non-clairvoyant weighted flow time scheduling on different multi-processor models ⋮ An improved branch-and-bound algorithm for the two machine total completion time flow shop problem ⋮ The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime ⋮ The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies ⋮ Two-machine flowshop scheduling with a secondary criterion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- The auction algorithm: A distributed relaxation method for the assignment problem
- Two-machine flowshop scheduling to minimize mean flow time
- Optimal two- and three-stage production schedules with setup times included
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
This page was built for publication: The two-machine total completion time flow shop problem
