An exact method for solving the two-machine flow-shop problem with time delays
Texte intégral
Documents relatifs
Table 4 reports the size of the critical tree for five branching rules (two static rules Forward, Alternate, and three dynamic strategies MaxSum, MinMin and MinBranch) and two
More precisely, at each node of the search tree, we solve a robust Basic Cyclic Scheduling Problem (BCSP), which corresponds to the CJSP without resource constraints, using a
For each instance, we give the best found lower (LB1) and upper (UB1) bounds, the total number of branch and bound nodes (#nodes), the total CPU time in seconds (CPU), the initial
In the first call to MERGE RIGHT NODES, the left merge is applied to the first element of rnodes (line 2), all the children nodes of nodes in rnodes not involved in right nor
[Fondrevelle et al., 2006] introduced an exact method based an a branch-and-bound scheme for the m-machine permutation flow- shop problem with minimal and maximal time lags..
Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates.. Antoine Jouglet,
In the sequel, we partially relax the constraint requiring that the robot can transfer at most one job at any time and we propose to investigate the ‡ow shop problem with blocking
In a two-machine flow shop scheduling problem, the set of - approximate sequences (i.e., solutions within a factor 1+ of the optimal) can be mapped to the vertices of a