scholarly journals Single-machine scheduling with no idle time and release dates to minimize a regular criterion

2010 ◽  
Vol 15 (2) ◽  
pp. 217-238 ◽  
Author(s):  
Antoine Jouglet
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Idle Time ◽  
Release Dates

Idle Time Treatment in the Single-Machine Scheduling Problem With Distinct Release Dates

2012 ◽  
Author(s):  
Shunji Tanaka
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Time Instant ◽  
Idle Time ◽  
Release Dates ◽  
Scheduling Problem ◽  
Current Time ◽  
Job Information ◽  
Time Treatment

The purpose of this study is to examine how idle time treatment in the single-machine scheduling problem with distinct (unequal) release dates affects schedules. For this purpose, two types of settings are considered: any idle time is permitted and unforced idle time is forbidden. In the latter setting, idle time is permitted only when no jobs are available, that is, release dates of unprocessed jobs are larger than the current time instant. Under these two idle time settings, the problem is solved both offline and online. In offline scheduling, all job information is known in advance and the schedule is optimized only once at time zero while in online scheduling, the schedule is re-optimized for only currently available jobs every time when a new job becomes available at its release date. Benchmark instances in the literature are solved by these approaches and the effect of idle time treatment on the obtained schedules is examined.

Faster algorithms for single machine scheduling with release dates and rejection

2016 ◽  
Vol 116 (8) ◽  
pp. 503-507 ◽  
Author(s):  
Jinwen Ou ◽  
Xueling Zhong ◽  
Chung-Lun Li
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Release Dates

A two-agent single-machine scheduling problem to minimize the total cost with release dates

2015 ◽  
Vol 21 (3) ◽  
pp. 805-816 ◽  
Author(s):  
Du-Juan Wang ◽  
Yunqiang Yin ◽  
Wen-Hsiang Wu ◽  
Wen-Hung Wu ◽  
Chin-Chia Wu ◽  
...  
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Release Dates ◽  
Scheduling Problem ◽  
Total Cost

scholarly journals An exact block algorithm for no-idle RPQ problem

2017 ◽  
Vol 27 (2) ◽  
pp. 323-330
Author(s):  
Jaroslaw Pempera
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Idle Time ◽  
Scheduling Problem ◽  
Delivery Time ◽  
Block Algorithm

Abstract In the work a single-machine scheduling problem is being considered, in which all tasks have a fixed availability (release) and delivery time. In the analyzed variant no-idle time is allowed on a machine. The purpose of optimization is to determine such order of tasks that minimizes the makespan, i.e. the time of execution of all the tasks. There is also a number of properties of the problem presented, in particular there are formulated block eliminating properties for no-idle constraint. There was an exact B&B algorithm based on the block properties proposed.

scholarly journals A Combinatorial 2-Approximation Algorithm for the Parallel-Machine Scheduling with Release Times and Submodular Penalties

Mathematics ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 61
Author(s):  
Wencheng Wang ◽  
Xiaofei Liu
Keyword(s):  
Approximation Algorithm ◽  
Single Machine ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Single Machine Scheduling ◽  
Release Time ◽  
Release Dates ◽  
Scheduling Problem ◽  
Release Times

In this paper, we consider parallel-machine scheduling with release times and submodular penalties (P|rj,reject|Cmax+π(R)), in which each job can be accepted and processed on one of m identical parallel machines or rejected, but a penalty must paid if a job is rejected. Each job has a release time and a processing time, and the job can not be processed before its release time. The objective of P|rj,reject|Cmax+π(R) is to minimize the makespan of the accepted jobs plus the penalty of the rejected jobs, where the penalty is determined by a submodular function. This problem generalizes a multiprocessor scheduling problem with rejection, the parallel-machine scheduling with submodular penalties, and the single machine scheduling problem with release dates and submodular rejection penalties. In this paper, inspired by the primal-dual method, we present a combinatorial 2-approximation algorithm to P|rj,reject|Cmax+π(R). This ratio coincides with the best known ratio for the parallel-machine scheduling with submodular penalties and the single machine scheduling problem with release dates and submodular rejection penalties.

Sign in / Sign up

Export Citation Format

Share Document