Two-Stage Flowshop Scheduling Problem with Bicriteria
From MaRDI portal
Publication:4022255
DOI10.1057/JORS.1992.126zbMATH Open0757.90037OpenAlexW2065163424MaRDI QIDQ4022255FDOQ4022255
Authors: Chandrasekharan Rajendran
Publication date: 17 January 1993
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.126
Recommendations
- scientific article; zbMATH DE number 1247725
- Two-machine flowshop scheduling with a secondary criterion
- A bicriteria approach to the two-machine flow shop scheduling problem
- Bicriterion scheduling in the two-machine flowshop
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (32)
- Genetic local search for multi-objective flowshop scheduling problems
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic
- Genetic algorithms for the two-stage bicriteria flowshop problem
- A bicriteria two-machine permutation flowshop problem
- Flowshop-scheduling problems with makespan criterion: a review
- Solving multi-objective production scheduling problems using metaheuristics
- A local search using solution fragments for the 2-machine bicriteria scheduling problem
- A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Flow-shop scheduling for three serial stations with the last two duplicate
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
- A bicriteria flowshop scheduling problem with setup times
- An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem
- The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
- Bilevel programming applied to the flow shop scheduling problem
- 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 problems: a survey
- A bicriteria flowshop scheduling with a learning effect
- A bicriteria approach to the two-machine flow shop scheduling problem
- Two-machine flowshop scheduling with a secondary criterion
- Multicriteria scheduling
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem
- Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
- Local search heuristics for two-stage flow shop problems with secondary criterion
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- Algorithms for bicriteria minimization in the permutation flow shop scheduling problem
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
- Counting and enumeration complexity with application to multicriteria scheduling
- A flexible flowshop problem with total flow time minimization
This page was built for publication: Two-Stage Flowshop Scheduling Problem with Bicriteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022255)