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) -
Online Scheduling on a Single Machine with Grouped Processing Times
by: Qijia Liu, et al.
Published: (2015-01-01) -
Big data predictions of Seasonal Fluctuations in Marine Traffic (using AIS data) by monitoring idle ships
by: Liliya Mileva
Published: (2024-12-01) -
Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents
by: Wen-Chiung Lee, et al.
Published: (2014-01-01) -
An Order Insertion Scheduling Model of Logistics Service Supply Chain Considering Capacity and Time Factors
by: Weihua Liu, et al.
Published: (2014-01-01)