Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs

•Examine a two-machine flowshop scheduling problem with deteriorating jobs.•Minimize the total completion time subject to minimum makespan.•Propose a mixed integer programming and branch-and-bound algorithm for the problem.•Discuss dominant conditions and several polynomial-time solvable special cas...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 234; H. 3; S. 650 - 657
Hauptverfasser: Cheng, Mingbao, Tadikamalla, Pandu R., Shang, Jennifer, Zhang, Shaqing
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.05.2014
Elsevier Sequoia S.A
Schlagworte:
Algorithms
Branch & bound algorithms
Branch-and-bound
Deteriorating job
Deterioration
Dominance
Hierarchical optimization
Integer programming
Job shops
Mathematical analysis
Mathematical models
Mathematical problems
Mixed integer programming
Operational research
Optimization
Polynomials
Production scheduling
Scheduling
Studies
Deteriorating job
Branch-and-bound
Mixed integer programming
Scheduling
Hierarchical optimization
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•Examine a two-machine flowshop scheduling problem with deteriorating jobs.•Minimize the total completion time subject to minimum makespan.•Propose a mixed integer programming and branch-and-bound algorithm for the problem.•Discuss dominant conditions and several polynomial-time solvable special cases.•Examine the effectiveness and efficiency of the proposed algorithms. We study a two-machine flowshop scheduling problem with time-dependent deteriorating jobs, i.e. the processing times of jobs are an increasing function of their starting time. The objective is to minimize the total completion time subject to minimum makespan. We propose a mixed integer programming model, and develop two pairwise interchange algorithms and a branch-and-bound procedure to solve the problem while using several dominance conditions to limit the size of the search tree. Several polynomial-time solvable special cases are discussed. Finally, numerical studies are performed to examine the effectiveness and the efficiency of the proposed algorithms.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2013.09.033