Genetic algorithms for the two-stage bicriteria flowshop problem
From MaRDI portal
Publication:1278393
DOI10.1016/0377-2217(95)00275-8zbMath0943.90584OpenAlexW2059586194MaRDI QIDQ1278393
Jatinder N. D. Gupta, Venkata Ranga Neppalli, Chuen-Lung S. Chen
Publication date: 22 February 1999
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)00275-8
Related Items
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ Two-machine flow shop scheduling with two criteria: maximum earliness and makespan ⋮ A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling ⋮ Solving multi-objective production scheduling problems using metaheuristics ⋮ Hybrid Taguchi-based particle swarm optimization for flowshop scheduling problem ⋮ Using genetic algorithm for dynamic and multiple criteria web-site optimizations ⋮ A local search using solution fragments for the 2-machine bicriteria scheduling problem ⋮ A heuristic approach to bicriteria scheduling ⋮ A fitness assignment strategy based on the grey and entropy parallel analysis and its application to MOEA ⋮ Evolutional reactive scheduling for agile manufacturing systems ⋮ Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints ⋮ Multicriteria scheduling problems: a survey ⋮ An improved genetic algorithm for the flowshop scheduling problem ⋮ Local search heuristics for two-stage flow shop problems with secondary criterion ⋮ Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Genetic algorithms and simulated annealing for scheduling in agile manufacturing ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Bicriteria train scheduling for high-speed passenger railroad planning applications ⋮ An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem ⋮ Using genetic algorithms for single-machine bicriteria scheduling problems ⋮ The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime ⋮ Two-machine flowshop scheduling with a secondary criterion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving a bicriterion scheduling problem
- A bicriterion approach to time/cost trade-offs in sequencing
- Complexity of single machine, multi-criteria scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Two-Stage Flowshop Scheduling Problem with Bicriteria
- One machine sequencing to minimize mean flow time with minimum number tardy
- A note on the extension of a result on scheduling with secondary criteria
