A Network Flow Model for Job-shop Scheduling Problem with Time-windows
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.
Job-shop Scheduling Problem Time windows network Flow Problem
Li Qingsong Sun Hong
School of Transportation and Automotive Engineering, Xihua University Chengdu, Sichuan, 610039, Chin Civil Aviation Flight University of China Chengdu, Sichuan, 610039, China
国际会议
长沙
英文
200-202
2010-05-11（万方平台首次上网日期，不代表论文的发表时间）