A Network Flow Model for Job-Shop Scheduling Problem with Time-Windows

Author

Qingsong, Li ; Hong, Sun

Author_Institution

Sch. of Transp. & Automotive Eng., Xihua Univ., Chengdu, China

Volume

1

fYear

2010

fDate

11-12 May 2010

Firstpage

200

Lastpage

202

Abstract

In this paper, we discuss generalized Job-shop Scheduling Problem with Time-windows, in which machines are distinguished, each job has to be started and finished within a given time window and the goal is to minimize the cost of processing. By indexing all the time dots of starts and ends of time windows, and describing them as nodes, the Job-shop Scheduling Problem with Time-windows is transformed into a network flow problem. Furthermore, an 0-1 integer programming mathematical model is built and a simulated annealing algorithm is given for solution.

Keywords

integer programming; job shop scheduling; simulated annealing; 0-1 integer programming mathematical model; job-shop scheduling; network flow model; simulated annealing algorithm; time-windows; Automation; Computer networks; Costs; Indexing; Intelligent networks; Intelligent vehicles; Linear programming; Mathematical model; Processor scheduling; Simulated annealing; Job-shop Scheduling Problem; Time windows; network Flow Problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Computation Technology and Automation (ICICTA), 2010 International Conference on

Conference_Location

Changsha

Print_ISBN

978-1-4244-7279-6

Electronic_ISBN

978-1-4244-7280-2

Type

conf

DOI

10.1109/ICICTA.2010.46

Filename

5523515