Family sequencing and cooperation
Soesja Grundel,
Barış Çiftçi,
Peter Borm and
Herbert Hamers
European Journal of Operational Research, 2013, vol. 226, issue 3, 414-424
Abstract:
This paper analyzes a single-machine scheduling problem with family setup times both from an optimization and a cost allocation perspective. In a family sequencing situation jobs are processed on a single machine, there is an initial processing order on the jobs, and every job within a family has an identical cost function that depends linearly on its completion time. Moreover, a job does not require a setup when preceded by another job from the same family while a family specific setup time is required when a job follows a member of some other family.
Keywords: Single-machine scheduling; Family scheduling model; Setup times; Cooperative game; Core; Marginal vector (search for similar items in EconPapers)
Date: 2013
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/S0377221712009149
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:ejores:v:226:y:2013:i:3:p:414-424
DOI: 10.1016/j.ejor.2012.11.060
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().