Single-machine scheduling problems with past-sequence-dependent delivery times

Christos Koulamas and George J. Kyparisis

International Journal of Production Economics, 2010, vol. 126, issue 2, 264-266

Abstract: We consider single-machine scheduling problems with past-sequence-dependent (p-s-d) job delivery times. The p-s-d delivery time is needed to remove any waiting time-induced adverse effects on the job's condition (prior to delivering the job to the customer) and it is therefore proportional to the job's waiting time. We show that single-machine scheduling problems with p-s-d delivery times and with either completion time-related criteria (such as the makespan or the total job completion time) or due date related criteria (such as the maximum lateness or the number of tardy jobs) can be solved by simple polynomial-time algorithms.

Keywords: Scheduling; Single-machine; Delivery; times (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(10)00098-8
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:126:y:2010:i:2:p:264-266

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().