Interval job scheduling with machine launch cost
We study an interval job scheduling problem in distributed systems. We are given a set of interval jobs, with each job specified by a size, an arrival time and a processing length. Once a job arrives, it must be placed on a machine immediately and run for a period of its processing length without in...
Saved in:
Main Authors: | Ren, Runtian, Zhu, Yuqing, Li, Chuanyou, Tang, Xueyan |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/161047 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Dynamic scheduling of manufacturing job shops using genetic algorithms
by: Chryssolouris, G., et al.
Published: (2014) -
Cloud scheduling with discrete charging units
by: Tan, Ming Ming, et al.
Published: (2020) -
Semi-online scheduling jobs with similar lengths and nondecreasing release
by: ANG, Marcus, et al.
Published: (2005) -
Reactive repair tool for job shop schedules
by: Subramaniam, V., et al.
Published: (2014) -
The early-tardy distinct due date machine scheduling problem with job splitting
by: HO KAH YUAN, BERNICE
Published: (2010)