Two-machine flowshop scheduling with a secondary criterion
From MaRDI portal
Publication:1870802
Recommendations
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- The two-machine total completion time flow shop problem
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
Cites work
- scientific article; zbMATH DE number 4093162 (Why is no real title available?)
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Genetic algorithms for the two-stage bicriteria flowshop problem
- Local search heuristics for two-stage flow shop problems with secondary criterion
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Multicriteria scheduling problems: a survey
- Optimal two- and three-stage production schedules with set-up time included
- The Complexity of Flowshop and Jobshop Scheduling
- The two-machine total completion time flow shop problem
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- Two-machine flowshop scheduling to minimize mean flow time
Cited in
(33)- Parallel flowshop scheduling using Tabu search
- Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
- Two-machine open shop scheduling with secondary criteria
- The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
- Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
- Multicriteria scheduling
- Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case
- A cyclical search for the two machine flow shop and open shop to minimise finishing time
- Two-machine flowshop scheduling to minimize mean flow time
- Minimising makespan in the two-machine flow-shop with release times
- Flowshop-scheduling problems with makespan criterion: a review
- A bicriteria flowshop scheduling with a learning effect
- Counting and enumeration complexity with application to multicriteria scheduling
- Local search heuristics for two-stage flow shop problems with secondary criterion
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times.
- Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
- A two-machine flowshop problem with two agents
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- Best compromise solution for a new multiobjective scheduling problem
- Bicriteria train scheduling for high-speed passenger railroad planning applications
- Practical solutions for a dock assignment problem with trailer transportation
- A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
- Flow-shop scheduling for three serial stations with the last two duplicate
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- A matheuristic approach for the two-machine total completion time flow shop problem
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- Scheduling alternative operations in two-machine flow-shops
This page was built for publication: Two-machine flowshop scheduling with a secondary criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870802)
