Makespan minimization for flow-shop problems with transportation times and a single robot
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
Computers and Operations Research
Single hoist cyclic scheduling with multiple tanks: a material handling solution
Computers and Operations Research - Special issue: Emerging economics
An Efficient Optimal Solution to the Two-Hoist No-Wait Cyclic Scheduling Problem
Operations Research
A faster polynomial algorithm for 2-cyclic robotic scheduling
Journal of Scheduling
Scheduling of single stage assembly with air transportation in a consumer electronic supply chain
Computers and Industrial Engineering - Special issue: Logistics and supply chain management
Minimizing makespan in a two-stage system with flowshop and open shop
Computers and Industrial Engineering
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints
Computers and Industrial Engineering
A contract net based intelligent agent system for solving the reactive hoist scheduling problem
Expert Systems with Applications: An International Journal
A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line
Operations Research Letters
Computers and Operations Research
Hi-index | 0.00 |
This article explores the coordinated scheduling problem between production and transportation in a steelmaking shop. Two models arising from steelmaking and refining operations are considered. The first model assumes that there is a converter at the steelmaking operation and a refining furnace at the refining operation. A transporter with capacity one is available to carry out jobs from converter to a refining furnace. The objective is to minimize the maximum completion time. For this model, we provide an algorithm with worst case ratio of two and show the computational results. The second model considers more practical situation in which jobs are processed in identical parallel converters first, and then the jobs coming from same converter are transported by a dedicated trolley with capacity one to the next operations. Two objectives are considered in the second model. One is to minimize the sum of maximum completion time, idle time penalties and waiting time penalties satisfying waiting time constraints. The other is to minimize the sum of maximum completion time, idle times penalties and hot consumption penalties related to waiting times while satisfying waiting time constraints. For the model, we develop a tabu search algorithm, provide the computational results and then give the worst case analysis.