A Mixed-Integer Linear Model for Solving the Open Shop Scheduling Problem

2021 ◽  
pp. 301-310
Author(s):  
Daniel Morillo-Torres ◽  
Gustavo Gatica
Keyword(s):  
Linear Model ◽  
Open Shop ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Open Shop Scheduling ◽  
Shop Scheduling ◽  
Integer Linear Model

Preemptive Open-Shop Scheduling: Network Flow Based Algorithm

2011 ◽  
Vol 215 ◽  
pp. 111-114 ◽  
Author(s):  
Yong Zhan ◽  
Yu Guang Zhong ◽  
Hai Tao Zhu
Keyword(s):  
Resource Allocation ◽  
Network Flow ◽  
Flow Model ◽  
Programming Model ◽  
Maximum Flow ◽  
Open Shop ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Open Shop Scheduling ◽  
Shop Scheduling

Preemptive open-shop scheduling problem was studied, and a network flow based algorithm was presented. Firstly, based on the characteristics of the preemptive open-shop, the scheduling problem was formulated as a mixed-integer programming model with the objective to minimize the make-span. The maximum flow model of the preemptive open-shop was developed to model the machine resource allocation and time constraints. Moreover a new preflow push algorithm for the maximum flow model was put forward. Based on the solution of machine resource allocation problem got by preflow push algorithm, the sequences of the tasks processed by each machine were determined by calculating the matrix of the processing times and decrementing set. Finally, the validity of the developed scheduling algorithm is illustrated by randomly generated example.

Sign in / Sign up

Export Citation Format

Share Document