Single-machine Scheduling with Splitable Jobs and Availability Constraints | Zendy

VanHuy Nguyen | Zendy; Nguyen Huynh Tuong | Zendy; Nguyen Hua Phung | Zendy; Thanh Nguyen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Single-machine Scheduling with Splitable Jobs and Availability Constraints

Author(s) -

VanHuy Nguyen,

Nguyen Huynh Tuong,

Nguyen Hua Phung,

Thanh Nguyen

Publication year - 2013

Publication title -

rev journal on electronics and communications

Language(s) - English

Resource type - Journals

ISSN - 1859-378X

DOI - 10.21553/rev-jec.51

Subject(s) - job shop scheduling , computer science , mathematical optimization , scheduling (production processes) , single machine scheduling , schedule , heuristic , fair share scheduling , flow shop scheduling , rate monotonic scheduling , mathematics , operating system

This paper deals with a single machine scheduling problem with availability constraints. The jobs are splitable and lower bound on the size of each sub-job is imposed. The objective is to find a feasible schedule that minimizes the makespan. The proposed scheduling problem is proved to be NP-hard in the strong sense. Some effective heuristic algorithms are then proposed. Additionally, computational results show that the proposed heuristic performs well.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research