Chen, Bo, Ye, Yinyu and Zhang, Jiawei (2006) Lot-sizing scheduling with batch setup times. Journal of Scheduling, Vol.9 (No.3). pp. 299-310. doi:10.1007/s10951-006-8265-7 ISSN 1094-6136.

Research output not available from this repository.

Request-a-Copy directly from author or use local Library Get it For Me service.

Request Changes to record.

Abstract

This paper is concerned with scheduling independent jobs on m parallel machines in such a way that the makespan is minimized. Each job j is allowed to split arbitrarily into several parts, which can be individually processed on any machine at any time. However, a setup for uninterrupted s(j) time units is required before any split part of job j can be processed on any machine. The problem is strongly NP-hard if the number m of machines is variable and weakly NP-hard otherwise. We give a polynomial-time 5/3-approximation algorithm for the former case and a fully polynomial-time approximation scheme for the latter.

Item Type:	Journal Article
Subjects:	T Technology > TS Manufactures H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management
Divisions:	Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School
Journal or Publication Title:	Journal of Scheduling
Publisher:	Springer New York LLC
ISSN:	1094-6136
Official Date:	June 2006
Dates:	Date Event June 2006 Published
Volume:	Vol.9
Number:	No.3
Number of Pages:	12
Page Range:	pp. 299-310
DOI:	10.1007/s10951-006-8265-7
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item