Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem

Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/663

Title:	Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
Authors:	Cheng, TCE Shakhlevich, NV
Issue Date:	1-Sep-2005
Source:	European journal of operational research, 1 Sept. 2005, v. 165, no. 2, p. 444-456
Abstract:	In this paper we study both the non-preemptive and preemptive versions of the popular unit-time open shop scheduling problem. For the set of feasible schedules which satisfy a predetermined order of job completion times, we construct the linear description of the convex hull of the vectors of the job completion times. Based on the properties of the resulting scheduling polyhedron, we show that the problem of constructing an optimal schedule minimizing an arbitrary non-decreasing separable cost function of job completion times is polynomially solvable.
Keywords:	Scheduling Open shop scheduling Parallel machine scheduling Separable non-decreasing function
Publisher:	Elsevier
Journal:	European journal of operational research
ISSN:	0377-2217
EISSN:	1872-6860
DOI:	10.1016/j.ejor.2004.04.014
Description:	Note: Pre-published version entitled: Minimizing Nondecreasing separable objective functions for the unit-time open shop scheduling problem. Project Management and Scheduling.
Rights:	European Journal of Operational Research © 2004 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:	Journal/Magazine Article

File	Description	Size	Format
uet.pdf	Pre-published version	189.23 kB	Adobe PDF	View/Open

Status	open access
File Version	Final Accepted Manuscript

View full-text via PolyU eLinks

78

Last Week
1

Last month

Citations as of Jun 4, 2023

181

Citations as of Jun 4, 2023

2

Last Week
0

Last month
0

Citations as of Jun 2, 2023

2

Last Week
0

Last month
0

Citations as of Jun 1, 2023

Check