An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions

2005 ◽  
Vol 32 (9) ◽  
pp. 2285-2296 ◽  
Author(s):  
Emerson C. Colin ◽  
Roberto C. Quinino
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Idle Time ◽  
Cost Functions ◽  
Scheduling Problem ◽  
Convex 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.

Idle time and capacity control for a single machine scheduling problem with dynamic electricity pricing

2020 ◽  
Vol 13 (3-4) ◽  
pp. 197-217
Author(s):  
Seokgi Lee ◽  
Mona Issabakhsh ◽  
Hyun Woo Jeon ◽  
Seong Wook Hwang ◽  
Byung Do Chung
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Idle Time ◽  
Scheduling Problem ◽  
Electricity Pricing ◽  
Capacity Control

A HYBRID PERMUTATION-CODED EVOLUTIONARY ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM

2010 ◽  
Vol 27 (06) ◽  
pp. 713-725 ◽  
Author(s):  
ALOK SINGH
Keyword(s):  
Genetic Algorithm ◽  
Steady State ◽  
Evolutionary Algorithm ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Idle Time ◽  
Scheduling Problem ◽  
Computational Results ◽  
Earliness And Tardiness

In this paper, we have proposed a hybrid permutation-coded steady-state genetic algorithm for a single machine scheduling problem with earliness and tardiness costs and no machine idle time. The steady-state genetic algorithm generates schedules, which are further improved by successive applications of an adjacent pairwise interchange procedure. We have compared our approach against the best approaches reported in the literature. Computational results show the effectiveness of our approach, since it obtained better quality solutions in shorter time.

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.

Sign in / Sign up

Export Citation Format

Share Document