Parallel machine scheduling with release dates, due dates and family setup times

Share/Save/Bookmark

Schutten, J.M.J. and Leussink, R.A.M. (1996) Parallel machine scheduling with release dates, due dates and family setup times. International Journal of Production Economics, 46-47 . pp. 119-126. ISSN 0925-5273

[img]
Preview
PDF
470Kb
Abstract:In manufacturing, there is a fundamental conflict between efficient production and delivery performance. Maximizing machine utilization by batching similar jobs may lead to poor delivery performance. Minimizing customers' dissatisfaction may lead to an inefficient use of the machines. In this paper, we consider the problem of scheduling n independent jobs with release dates, due dates, and family setup times on m parallel machines. The objective is to minimize the maximum lateness of any job. We present a branch-and-bound algorithm to solve this problem. This algorithm exploits the fact that an optimal schedule is contained in a specific subset of all feasible schedules. For lower bounding purposes, we see setup times as setup jobs with release dates, due dates and processing times. We present two lower bounds for the problem with setup jobs, one of which proceeds by allowing preemption.
Item Type:Article
Copyright:© 1996 Elsevier Science
Faculty:
Management and Governance (SMG)
Research Chair:
Research Group:
Link to this item:http://purl.utwente.nl/publications/32192
Official URL:http://dx.doi.org/10.1016/0925-5273(95)00086-0
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 144442