Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stage heuristic algorithm

2009 ◽  
Vol 46 (9-12) ◽  
pp. 1229-1237 ◽  
Author(s):  
Quan-Ke Pan ◽  
Ponnuthurai N. Suganthan ◽  
Tay J. Chua ◽  
T. X. Cai
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Heuristic Algorithm ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Two Stage ◽  
Manpower Scheduling

Mixed-integer Programming of Stochastic Hydro Self-scheduling Problem in Joint Energy and Reserves Markets

2016 ◽  
Vol 44 (7) ◽  
pp. 752-762 ◽  
Author(s):  
Mahmoud Sharafi Masouleh ◽  
Farshid Salehi ◽  
Fatima Raeisi ◽  
Mojtaba Saleh ◽  
Azade Brahman ◽  
...  
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Mixed Integer ◽  
Scheduling Problem

scholarly journals A Heuristic Approach for Determining Lot Sizes and Schedules Using Power-of-Two Policy

2007 ◽  
Vol 2007 ◽  
pp. 1-18
Author(s):  
Esra Ekinci ◽  
Arslan M. Ornek
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Flow Shop ◽  
Lot Sizing ◽  
Mixed Integer ◽  
Scheduling Problem ◽  
Binary Integer Programming ◽  
Multistage Manufacturing ◽  
Lot Sizing Problem ◽  
Lot Sizes

We consider the problem of determining realistic and easy-to-schedule lot sizes in a multiproduct, multistage manufacturing environment. We concentrate on a specific type of production, namely, flow shop type production. The model developed consists of two parts, lot sizing problem and scheduling problem. In lot sizing problem, we employ binary integer programming and determine reorder intervals for each product using power-of-two policy. In the second part, using the results obtained of the lot sizing problem, we employ mixed integer programming to determine schedules for a multiproduct, multistage case with multiple machines in each stage. Finally, we provide a numerical example and compare the results with similar methods found in practice.

Sign in / Sign up

Export Citation Format

Share Document