Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions
From MaRDI portal
Publication:1011174
DOI10.1016/j.ejor.2007.09.038zbMath1157.90545OpenAlexW2027017692MaRDI QIDQ1011174
Jean-Marc Martel, Belaïd Aouni, Mohamed Anis Allouche, Taïcir Loukil, Abdelwaheb Rebaï
Publication date: 8 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.09.038
Related Items (3)
Reference points and approximation algorithms in multicriteria discrete optimization ⋮ Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives ⋮ A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- Solving a bicriterion scheduling problem
- Multiple criteria decision making, 22nd International Meeting of TIMS, July 24--26, 1975, Kyoto/Japan
- Solving multi-objective production scheduling problems using metaheuristics
- Multicriteria scheduling problems: a survey
- Optimal two- and three-stage production schedules with setup times included
- Minimising makespan in the two-machine flow-shop with release times
- A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
- Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Incorporating the Decision-maker's Preferences in the Goal-programming Model
This page was built for publication: Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions
