FPTAS for the two identical parallel machine problem with a single operator under the free changing mode

Pierre Baptiste, Djamal Rebaine and Mohammed Zouba

European Journal of Operational Research, 2017, vol. 256, issue 1, 55-61

Abstract: We address in this paper the problem of scheduling a set of independent and non-preemptive jobs on two identical parallel machines with a single operator in order to minimize the makespan. The operator supervises the machines through a subset of a given set of modi operandi: the working modes. A working mode models the way the operator divides up his interventions between the machines. The processing times thus become variable as they now depend on the working mode being utilized. To build a schedule, we seek not only a partition of the jobs on the machines, but also a subset of working modes along with their duration. A pseudo-polynomial time algorithm is first exhibited, followed by a fully polynomial time approximation scheme (FPTAS) to generate an optimal solution within the free changing mode.

Keywords: FPTAS; Free changing mode; Identical parallel machines; Operator (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221716304167
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:256:y:2017:i:1:p:55-61

DOI: 10.1016/j.ejor.2016.05.062

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 (repec@elsevier.com).