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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 234; číslo 3; s. 650 - 657
Hlavní autori:	Cheng, Mingbao, Tadikamalla, Pandu R., Shang, Jennifer, Zhang, Shaqing
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.05.2014 Elsevier Sequoia S.A
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!