Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time

H.A.J. Crauwels, A.M.A. Hariri, C.N. Potts and L.N. Van Wassenhove

Annals of Operations Research, 1998, vol. 83, issue 0, 59-76

Abstract: This paper presents several branch and bound algorithms for a single-machine scheduling problem with batching. Jobs are partitioned into families, and a set-up time is necessary when there is a switch from processing jobs of one family to jobs of another family. The objective is to minimize the total weighted completion time. A lower bound based on Lagrangian relaxation of the machine capacity constraint is derived. Also, a multiplier adjustment method to find values of the multipliers is proposed. Computational experience with instances having up to 50 jobs shows that the lower bounds are effective in restricting the search. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018920416308 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:83:y:1998:i:0:p:59-76:10.1023/a:1018920416308

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018920416308

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().