Two-machine shop scheduling with two agents and linear deteriorating jobs

Author

Xiaoli Zhao ; Gongshu Wang

Author_Institution

Liaoning Key Lab. of Manuf. Syst. & Logistics, Northeastern Univ., Shenyang, China

fYear

2015

fDate

23-25 May 2015

Firstpage

1154

Lastpage

1159

Abstract

We consider a two-machine shop scheduling problem in which the jobs are from two agents and each job has a time-dependent proportional deteriorating processing time. The two agents compete for a common two-machine shop setting to process their own jobs. Each agent has its own criterion to optimize. Three shop settings are investigated: flow-shop, open-shop and job-shop. For each setting, the goal is to find a schedule to process the jobs such that the makespan of one agent is minimized while the makespan of the other agent is no more than a given upper bound. We prove that all the problems are NP-hard. Moreover, we present efficient algorithms for two special cases of flow-shop scheduling problem.

Keywords

flow shop scheduling; job shop scheduling; NP-hard; agent makespan; flow-shop scheduling problem; job-shop; linear deteriorating jobs; open-shop; time-dependent proportional deteriorating processing time; two-machine shop scheduling problem; Job shop scheduling; Optimal scheduling; Processor scheduling; Schedules; Single machine scheduling; Upper bound; Deterioration; Scheduling; Shop setting; Two-agent;

fLanguage

English

Publisher

ieee

Conference_Titel

Control and Decision Conference (CCDC), 2015 27th Chinese

Conference_Location

Qingdao

Print_ISBN

978-1-4799-7016-2

Type

conf

DOI

10.1109/CCDC.2015.7162091

Filename

7162091