Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions

The multi-criteria scheduling problem is one of the main research subjects in the field of multiple objectives programming. Several procedures have been developed to deal with this type of problem where some conflicting criteria have to be optimized simultaneously. The aim of our paper is to propose...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 192; číslo 2; s. 460 - 467
Hlavní autoři: Allouche, Mohamed Anis, Aouni, Belaïd, Martel, Jean-Marc, Loukil, Taïcir, Rebaï, Abdelwaheb
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.01.2009
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Applied sciences
Compromise programming
Criteria
Exact sciences and technology
Flow shop
Flow shop Multi-criteria scheduling Compromise programming Satisfaction functions Manager's preferences
Inventory control, production control. Distribution
Job shops
Manager’s preferences
Mathematical models
Mathematical programming
Multi-criteria scheduling
Operational research and scientific management
Operational research. Management science
Problem solving
Production scheduling
Satisfaction functions
Scheduling, sequencing
Studies
Flow shop
Multi-criteria scheduling
Satisfaction functions
Manager’s preferences
Compromise programming
Multicriteria analysis
Multiobjective programming
Scheduling
Makespan
Modeling
Delay
Aggregation
Manager's preferences
Preference
Aspiration level
Achievement
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The multi-criteria scheduling problem is one of the main research subjects in the field of multiple objectives programming. Several procedures have been developed to deal with this type of problem where some conflicting criteria have to be optimized simultaneously. The aim of our paper is to propose an aggregation procedure that integrates three different criteria to find the best sequence in a flow shop production environment. The compromise programming model and the concept of satisfaction functions will be utilized to integrate explicitly the manager’s preferences according to the deviations between the achievement and the aspiration levels of the following criteria: Makespan, total flow time and total tardiness.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2007.09.038