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!

Schreiben Sie den ersten Kommentar!