A fixed job scheduling problem with machine-dependent job weights

Date

2009-01-01

Author

Eliiyi, D. T.
Azizoğlu, Meral

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

This study considers the identical parallel machines operational fixed job scheduling problem with machine-dependent job weights. A job is either processed in a fixed interval or is not processed at all. Our aim is to maximise the total weight of the processed jobs. We show that the problem with machine eligibility constraints resides as a special case of this problem. We identify some special polynomially solvable cases and propose a branch-and-bound (BB) algorithm that employs efficient bounding schemes and dominance conditions. Computational experience on large-sized problem examples reveals the satisfactory performance of the BB algorithm.

Subject Keywords

Fixed job scheduling, Machine-dependent job weights, Eligibility constraints

URI

https://hdl.handle.net/11511/33054

Collections

Department of Industrial Engineering, Article