-

 

 

 




Optimization Online





 

An Exact Extended Formulation for the Unrelated Parallel Machine Total Weighted Completion Time Problem

Kerem Bulbul (bulbul***at***sabanciuniv.edu)
Halil Sen (halilsen***at***sabanciuniv.edu)

Abstract: The plethora of research on NP-hard parallel machine scheduling problems is focused on heuristics due to the theoretically and practically challenging nature of these problems. Only a handful of exact approaches are available in the literature, and most of these suffer from scalability issues. Moreover, the majority of the papers on the subject are restricted to the identical parallel machine scheduling environment. In this context, the main contribution of this work is to recognize and prove that a particular preemptive relaxation for the problem of minimizing the total weighted completion time (TWCT) on a set of unrelated parallel machines naturally admits a non-preemptive optimal solution and gives rise to an exact mixed integer linear programming formulation of the problem. Furthermore, we exploit the structural properties of TWCT and attain a very fast and scalable exact Benders decomposition-based algorithm for solving this formulation. Computationally, our approach holds great promise and may even be embedded into iterative algorithms for more complex shop scheduling problems as instances with up to 1000 jobs and 8 machines are solved to optimality within a few seconds.

Keywords: unrelated parallel machines; weighted completion time; Benders decomposition; cut strengthening; exact method; preemptive relaxation; transportation problem.

Category 1: Applications -- OR and Management Sciences (Scheduling )

Category 2: Integer Programming ((Mixed) Integer Linear Programming )

Category 3: Integer Programming (Cutting Plane Approaches )

Citation: Bulbul, K. and Sen, H. (2017). An Exact Extended Formulation for the Unrelated Parallel Machine Total Weighted Completion Time Problem. Journal of Scheduling, 20(4):373-389. http://dx.doi.org/10.1007/s10951-016-0485-x

Download: [PDF]

Entry Submitted: 08/28/2014
Entry Accepted: 08/28/2014
Entry Last Modified: 08/27/2017

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society