scholarly journals A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk

2018 ◽  
Vol 31 (2) ◽  
pp. 472-496 ◽  
Author(s):  
M. Urgo ◽  
J. Váncza
Keyword(s):  
At Risk ◽  
Branch And Bound ◽  
Single Machine ◽  
Value At Risk ◽  
Stochastic Scheduling ◽  
Maximum Lateness ◽  
Scheduling Problem

A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents

2013 ◽  
Vol 13 (2) ◽  
pp. 1042-1054 ◽  
Author(s):  
Yunqiang Yin ◽  
Chin-Chia Wu ◽  
Wen-Hsiang Wu ◽  
Chou-Jung Hsu ◽  
Wen-Hung Wu
Keyword(s):  
Branch And Bound ◽  
Single Machine ◽  
Scheduling Problem ◽  
Two Agents

scholarly journals Single-Machine Scheduling with Workload-Dependent Maintenance Duration to Minimize Maximum Lateness

2015 ◽  
Vol 2015 ◽  
pp. 1-5 ◽  
Author(s):  
Ting Wang ◽  
Dehua Xu
Keyword(s):  
Single Machine ◽  
Time Window ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maximum Lateness ◽  
Scheduling Problem ◽  
Due Date ◽  
Start Time ◽  
Tight Bound ◽  
Special Cases

A single-machine scheduling problem with a mandatory maintenance whose duration is workload-dependent is considered. The start time of the maintenance is restricted to a time window. The objective is to determine the start time of the maintenance and schedule all the jobs to the machine such that the maximum lateness is minimized. An approximation algorithm based on the classical Earliest Due Date first rule is proposed. It is showed that the proposed algorithm is optimal for some special cases and that it has a tight bound for the scheduling problem under consideration.

Sign in / Sign up

Export Citation Format

Share Document