Single Machine Predictive Scheduling Using Inserted Idle Times
A single machine predictive scheduling problem is considered. The primary objective is to minimize the total completion times. The predictability of the schedule is measured by the completion time deviations between the predictive schedule and realized schedule. The surrogate measure of predictabili...
Saved in:
Main Authors: | Hongli Zhu, Hong Zhou |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2014/304808 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Bertrand Russell and Catalan Literature: In Praise of Idleness and Other Essays and Dictionary for the Idle
by: Gonçal López-Pampló Rius
Published: (2024-12-01) -
Using idle TDMA slots for retransmitting packets cooperatively in VANET
by: Zhen CHEN, et al.
Published: (2015-07-01) -
Energy-saving algorithm considering idle light-path prediction in SDM-EON
by: Yu XIONG, et al.
Published: (2019-10-01) -
Online Scheduling on a Single Machine with Grouped Processing Times
by: Qijia Liu, et al.
Published: (2015-01-01) -
ELIMINATING ENFORCED IDLENESS OF RESOURCES AND JOB WAITING TIME IN TIME CONSTRAINED CONSTRUCTION ACTIVITIES USING WAITING LINE THEORY
by: Oluseye OLUGBOYEGA
Published: (2015-12-01)