A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times

Computers and Operations Research

Volumn 35, Issue 4, 2008, Pages 1099-1111

  Mahdavi Mazdeh, Mohammad ^a   Sarhadi, Mansoor ^a   Hindi, Khalil S ^b  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

Author keywords

Batch delivery; Branch and bound; Scheduling; Single machine

Indexed keywords

BRANCH AND BOUND METHOD; COSTS; DYNAMIC PROGRAMMING; PROBLEM SOLVING; SCHEDULING;

BATCH DELIVERY; DELIVERY COSTS; SINGLE MACHINES;

RESOURCE ALLOCATION;

EID: 35248888931     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2006.07.006     Document Type: Article

References (14)

1. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
2. Baker K.R. Introduction to sequencing and scheduling (1974), Wiley, New York
3. Smith W.E. Various optimizers for single stage production. Naval Research Logistic Quarterly 3 (1956) 59-66
4. Chu C. Efficient heuristics to minimize total flow time with release dates. Operations Research Letters 12 (1992) 321-330
5. Deogun J.S. On scheduling with ready times to minimize mean flow time. The Computer Journal 26 (1983) 320-328
6. Dessouky M.I., and Deogun J.S. Sequencing jobs with unequal ready times to minimize mean flow time. SIAM Journal on Computing 10 (1981) 192-202
7. Bianco L., and Ricciardelli S. Scheduling of a single machine to minimize total weighted completion time subject to release dates. Naval Research Logistics Quarterly 29 (1982) 151-167
8. Belouadah H., Posner M.E., and Potts C.N. Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics 36 (1992) 213-231
9. Cheng T.C.E., Gordon V.S., and Kovalyov M.Y. Single machine scheduling with batch deliveries. European Journal of Operational Research 115 (1996) 227-283
10. Lee C.-Y., and Chen Z.-L. Machine scheduling with transportation consideration. Journal of Scheduling 4 (2001) 3-24
11. Hall N.G., and Potts C.N. Supply chain scheduling: batching and delivery. Operations Research 51 (2003) 566-584
12. Mahdavi Mazdeh M, Sarhadi M, Hindi KS. A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs; 2006, submitted for publication.
13. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic machine scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
14. Mahdavi Mazdeh M. Minimizing the sum of flow times with batching and delivery in a supply chain. PhD thesis, Brunel University, England, 2005.