The University of Southampton
University of Southampton Institutional Repository

Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation

Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation
We consider various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time. We focus on problems of minimizing the makespan or the sum of (weighted) completion times of the jobs. In many situations we show that the objective function is priority-generating, and therefore the corresponding scheduling problem under series-parallel precedence constraints is polynomially solvable. In other situations we provide counter-examples that show that the objective function is not priority-generating.
single machine scheduling, deteriorating jobs, learning effect, precedence constraints, priority-generating functions
357-370
Gordon, V.S.
e5584b74-79fc-43b9-b143-1e467ff64f5a
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Strusevich, V.A.
c3492f02-0366-4bf0-8754-530231572039
Whitehead, J.D.
5ddc4b76-a666-4820-8e00-79d85ca79d40
Gordon, V.S.
e5584b74-79fc-43b9-b143-1e467ff64f5a
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Strusevich, V.A.
c3492f02-0366-4bf0-8754-530231572039
Whitehead, J.D.
5ddc4b76-a666-4820-8e00-79d85ca79d40

Gordon, V.S., Potts, C.N., Strusevich, V.A. and Whitehead, J.D. (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. Journal of Scheduling, 11 (5), 357-370. (doi:10.1007/s10951-008-0064-x).

Record type: Article

Abstract

We consider various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time. We focus on problems of minimizing the makespan or the sum of (weighted) completion times of the jobs. In many situations we show that the objective function is priority-generating, and therefore the corresponding scheduling problem under series-parallel precedence constraints is polynomially solvable. In other situations we provide counter-examples that show that the objective function is not priority-generating.

Text
DeteriorLearnEPrints.pdf - Version of Record
Restricted to Repository staff only
Request a copy

More information

e-pub ahead of print date: 13 May 2008
Published date: 1 October 2008
Keywords: single machine scheduling, deteriorating jobs, learning effect, precedence constraints, priority-generating functions
Organisations: Operational Research

Identifiers

Local EPrints ID: 156307
URI: http://eprints.soton.ac.uk/id/eprint/156307
PURE UUID: f14ab034-63ee-417e-a079-09ff8463a3d1

Catalogue record

Date deposited: 01 Jun 2010 09:15
Last modified: 02 Dec 2019 21:19

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×