Skip to Main content Skip to Navigation
New interface
Journal articles

Scheduling with divisible jobs and subcontracting option

Abstract : In electronics industry, aircraft manufacturing, distributed computer systems and supply chains, it is common that many jobs are divisible and can be considered as a batch of potentially infinitely small and independent items. Subcontracting divisible jobs means that a job can be partially processed by an in-house machine and the remaining of it can be processed by a subcontractor's machine. Considering three subcontracting pricing strategies: non-increasing, non-decreasing and constant over time, this paper studies a scheduling problem with divisible jobs and subcontracting option in which both the manufacturer and the subcontractor are in single-machine environment. The objective is to minimize the sum of total weighted tardiness and total subcontracting costs. A mixed integer programming (MIP) model is formulated. Then a Lagrangian-based Benders Dual Decomposition (denoted by LB-BDD) method is developed based on the MIP formulation. Extensive computational experiments are conducted on five groups of randomly generated problem instances, and the results show that the proposed LB-BDD method outperforms the basic Benders Decomposition (denoted by BD) method and solving the MIP model directly in Gurobi solver.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03673245
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Friday, May 20, 2022 - 8:19:19 AM
Last modification on : Tuesday, August 30, 2022 - 5:04:23 PM

Identifiers

Citation

Shijin Wang, Ying Lu, Feng Chu, Jianbo Yu. Scheduling with divisible jobs and subcontracting option. Computers and Operations Research, 2022, 145, pp.105850. ⟨10.1016/j.cor.2022.105850⟩. ⟨hal-03673245⟩

Share

Metrics

Record views

29