• An improved branch-and-bound a...

Result: An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

Title:
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
Authors:
DELLA CROCE DI DOJOLA, Federico, GHIRARDI, MARCO, TADEI, Roberto
Source:
European Journal of Operational Research. 139:293-301
Publisher Information:
Elsevier BV, 2002.
Publication Year:
2002
Subject Terms:
flow shop scheduling, Other numerical methods in calculus of variations, Polyhedral combinatorics, branch-and-bound, branch-and-cut, branch-and-bound, Programming involving graphs or networks, Optimality conditions and duality in mathematical programming, Lagrangean relaxation
Document Type:
Academic journal Article<br />Conference object
File Description:
application/xml
Language:
English
ISSN:
0377-2217
DOI:
10.1016/s0377-2217(01)00374-5
Access URL:
http://www.sciencedirect.com/science/article/pii/S0377221701003745
https://www.sciencedirect.com/science/article/pii/S0377221701003745
https://doi.org/10.1016/S0377-2217(01)00374-5
https://iris.polito.it/handle/11583/1399390
https://ideas.repec.org/a/eee/ejores/v139y2002i2p293-301.html
https://econpapers.repec.org/article/eeeejores/v_3a139_3ay_3a2002_3ai_3a2_3ap_3a293-301.htm
https://hdl.handle.net/11583/1399390
https://hdl.handle.net/11583/1412352
Rights:
Elsevier TDM
Accession Number:
edsair.doi.dedup.....2ef2b8acf843b4ffec4bf04e6714dfb5
Database:
OpenAIRE

Further Information

zbMATH Open Web Interface contents unavailable due to conflicting licenses.