Simulated-annealing heuristics for the single-machine scheduling problem with learning and unequal job release times

2011 ◽  
Vol 30 (1) ◽  
pp. 54-62 ◽  
Author(s):  
Chin-Chia Wu ◽  
Peng-Hsiang Hsu ◽  
Kunjung Lai
Keyword(s):  
Simulated Annealing ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Release Times

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.

Single Machine Scheduling with Discretely Compressible Processing Times

2013 ◽  
Vol 787 ◽  
pp. 1020-1024
Author(s):  
Shu Xia Zhang ◽  
Yu Zhong Zhang
Keyword(s):  
Dynamic Programming ◽  
Single Machine ◽  
Processing Time ◽  
Machine Scheduling ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Processing Times ◽  
Release Times

In this paper, we address the single machine scheduling problem with discretely compressible processing times, where processing any job with a compressed processing time incurs a corresponding compression cost. We consider the following problem: scheduling with discretely compressible processing times to minimize makespan with the constraint of total compression cost. Jobs may have different release times. We design a pseudo-polynomial time algorithm by approach of dynamic programming and an FPTAS.

Sign in / Sign up

Export Citation Format

Share Document