Normal view MARC view

Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time

Author: Crauwels, H.A.J ; Hariri, A. M. A. ; Van Wassenhove, Luk N.INSEAD Area: Technology and Operations ManagementIn: Annals of Operations Research, 83, 1998 Language: EnglishDescription: p. 59-76.Type of document: INSEAD ArticleNote: Please ask us for this itemAbstract: This paper presents several branch and bound algorithms for a single-machine scheduling problem with batching. Jobs are partioned 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
Tags: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode Item holds
INSEAD Article Europe Campus
Available BC004103
Total holds: 0

Ask Qualtrics

This paper presents several branch and bound algorithms for a single-machine scheduling problem with batching. Jobs are partioned 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

Digitized

There are no comments for this item.

Log in to your account to post a comment.
Koha 18.11 - INSEAD Catalogue
Home | Contact Us | What's Koha?