Comparisons of three mixed integer programming models for parallel machine scheduling

2016 ◽  
Author(s):  
Shan-Hao Yu ◽  
Yi-Feng Hung
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Programming Models ◽  
Mixed Integer

Mixed Integer Programming Models on Scheduling Automated Stacking Cranes

2021 ◽  
Vol 8 (4) ◽  
pp. 11-33
Author(s):  
Amir Gharehgozli ◽  
Orkideh Gharehgozli ◽  
Kunpeng Li
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Recent Trend ◽  
Container Terminals ◽  
Programming Models ◽  
Mixed Integer ◽  
Global Supply Chains ◽  
Objective Functions ◽  
Operational Constraints ◽  
Automated Stacking Cranes

Automated deep-sea container terminals are the main hubs to move millions of containers in today's global supply chains. Terminal operators often decouple the landside and waterside operations by stacking containers in stacks perpendicular to the quay. Traditionally, a single automated stacking cranes (ASC) is deployed at each stack to handle containers. A recent trend is to use new configurations with more than one crane to improve efficiency. A variety of new configurations have been implemented, such as twin, double, and triple ASCs. In this paper, the authors explore and review the mixed integer programming models that have been developed for the stacking operations of these new configurations. They further discuss how these models can be extended to contemplate diverse operational constraints including precedence constraints, interference constraints, and other objective functions.

Application of Mixed-Integer Programming and Dispatching Rules on Parallel Machine Scheduling with Inserted Idle Time

2013 ◽  
Vol 437 ◽  
pp. 748-751
Author(s):  
Chi Yang Tsai ◽  
Yi Chen Wang
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Parallel Machines ◽  
Optimal Solution ◽  
Parallel Machine Scheduling ◽  
Idle Time ◽  
Dispatching Rules ◽  
Mixed Integer ◽  
Scheduling Problems

This research considers the problem of scheduling jobs on unrelated parallel machines with inserted idle times to minimize the earliness and tardiness. The aims at investigating how particular objective value can be improved by allowing machine idle time and how quality solutions can be more effectively obtained. Two mixed-integer programming formulations combining with three dispatching rules are developed to solve such scheduling problems. They can easy provide the optimal solution to problem involving about nine jobs and four machines. From the results of experiments, it is found that: (1) the inserted idle times decreases objective values more effectively; (2) three dispatching rules are very competitive in terms of efficiency and quality of solutions.

Sign in / Sign up

Export Citation Format

Share Document