Single Machine Group Scheduling with Position Dependent Processing Times and Ready Times

Xingong Zhang and Qiulian Xie

Mathematical Problems in Engineering, 2015, vol. 2015, 1-9

Abstract:

We investigate a single machine group scheduling problem with position dependent processing times and ready times. The actual processing time of a job is a function of positive group-dependent job-independent positional factors. The actual setup time of the group is a linear function of the total completion time of the former group. Each job has a release time. The decision should be taken regarding possible sequences of jobs in each group and group sequence to minimize the makespan. We show that jobs in each group are scheduled in nondecreasing order of its release time and the groups are arranged in nondecreasing order of some certain conditions. We also present a polynomial time solution procedure for the special case of the proposed problem.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2015/206230.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2015/206230.xml (text/xml)

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:hin:jnlmpe:206230

DOI: 10.1155/2015/206230

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().