Steelmaking and refining coordinated scheduling problem with waiting time and transportation consideration

Computers and Industrial Engineering

Volumn 58, Issue 2, 2010, Pages 239-248

  Tang, Lixin ^a   Guan, Jing ^b   Hu, Guofen ^c  

^a NORTHEASTERN UNIVERSITY   (China)

^b CIVIL AVIATION UNIVERSITY OF CHINA   (China)

^c BAOSTEEL RESEARCH INSTITUTE   (China)

Author keywords

Hot consumption; Mathematical model; Scheduling; Tabu search; Transportation; Worst case analysis

Indexed keywords

COMPLETION TIME; COMPUTATIONAL RESULTS; HOT CONSUMPTION; IDLE TIME; IDLE TIME PENALTIES; PARALLEL CONVERTER; SCHEDULING PROBLEM; STEELMAKING OPERATION; TABU SEARCH ALGORITHMS; WAITING-TIME; WORST CASE; WORST-CASE ANALYSIS;

COMPUTER SIMULATION; FURNACES; LEARNING ALGORITHMS; METAL REFINERIES; METALLURGICAL FURNACES; REFINING; STEELMAKING; STEELMAKING FURNACES; TABU SEARCH;

MATHEMATICAL MODELS;

EID: 76349105056     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2009.07.014     Document Type: Article

References (25)

1. Allaoui H., and Artiba A. Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers and Industrial Engineering 47 (2004) 431-450
2. Brucker P., Knust S., Cheng T.C.E., and Shakhlevich N.V. Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Annals of Operations Research 129 (2004) 81-106
3. Chang Y.C., and Lee C.Y. Machine scheduling with job delivery coordination. European Journal of Operational Research 158 (2004) 470-487
4. Che A., and Chu C.B. A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line. Operations Research Letters 33 (2005) 274-284
5. Chen Z.L. Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs. European Journal of Operational Research 93 (1996) 49-60
6. Chen H.X., Chu C.B., and Proth J.M. Cyclic scheduling of a hoist with time window constraints. IEEE Transactions on Robotics and Automation 14 (1998) 144-152
7. Chu C.B. A fast polynomial algorithm for 2-cyclic robotic scheduling. Journal of Scheduling 9 (2006) 453-468
8. Glover F. Tabu search - Part I. ORSA Journal on Computing 1 (1989) 190-206
9. Hurink J., and Knust S. Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Applied Mathematics 112 (2001) 199-216
10. Jégou D., Kim D.W., Baptiste P., and Lee K.H. A contract net based intelligent agent system for solving the reactive hoist scheduling problem. Expert Systems with Applications 30 (2006) 156-167
11. Lee C.Y., and Chen Z.L. Machine scheduling with transportation considerations. Journal of Scheduling 4 (2001) 3-24
12. Li K., Ganesan V.K., and Sivakumar A.I. Scheduling of single stage assembly with air transportation in a consumer electronic supply chain. Computers and Industrial Engineering 51 (2006) 264-278
13. Li C.L., Vairaktarakis G., and Lee C.Y. Machine scheduling with deliveries to multiple customer locations. European Journal of Operational Research 164 (2005) 39-51
14. Lim A., Rodrigues B., and Xu Z. A m-parallel crane problem with a non-crossing constraint. Naval Research Logistics 54 (2007) 1-13
15. Liu J.Y., and Jiang Y. An efficient optimal solution to the two-hoist no-wait cyclic scheduling problem. Operations Research 53 (2005) 313-327
16. Maggu P.L., Das G., and Kumar R. On equivalent job-for-job block in 2 × n sequencing problem with transportation times. Journal of the Operations Research Society of Japan 24 (1981) 136-146
17. Maggu P.L., Singhal M.L., Mohammad N., and Yadav S.K. On n-job, 2-machine flow-shop scheduling problem with arbitrary time lags and transportation times of jobs. Journal of the Operations Research Society of Japan 25 (1982) 219-227
18. Shen S.Y., and Honda M. Incorporating lateral transfers of vehicles and inventory into an integrated replenishment and routing plan for a there-echelon supply chain. Computers and Industrial Engineering (2007) 10.1016/j.cie.2007.09.004
19. Su L.H., Chou F.D., and Ting W.C. Minimizing makespan in a two-stage system with flowshop and open shop. Computers and Industrial Engineering 49 (2005) 520-536
20. Sung C.S., and Kim Y.H. Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed. Computer and Operations Research 29 (2002) 275-294
21. Sung C.S., and Min J.I. Scheduling in a two-machine flowshop with batch processing machine(s) for earliness under a common due date. European Journal of Operational Research 131 (2001) 95-106
22. Tang L.X., Liu J.Y., Rong A.Y., and Yang Z.H. A mathematical programming model for scheduling steelmaking-continuous casting production. European Journal of Operational Research 120 (2000) 423-435
23. Tanizaki T., Tamura T., Sakai H., Takahashi Y., and Imai T. A heuristics scheduling algorithm for steel making process with crane handling. Journal of the Operations Research Society of Japan 49 (2006) 188-201
24. Wang G.Q., and Cheng T.C.E. Parallel machine scheduling with batch delivery costs. International Journal of Production Economics 68 (2000) 177-183
25. Zhou Z.L., and Li L. Single hoist cyclic scheduling with multiple tanks: A material handling solution. Computers and Operations Research 30 (2003) 811-819