๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-Linear Cost Functions

โœ Scribed by Bahram Alidaee

Book ID
125581228
Publisher
Palgrave Publishers Ltd.
Year
1990
Tongue
English
Weight
131 KB
Volume
41
Category
Article
ISSN
0160-5682

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling linear deteriorating jobs to
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
โœ Chin-Chia Wu; Wen-Chiung Lee ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 74 KB

The scheduling problem with deteriorating jobs to minimize the makespan on a single machine where the facility has an availability constraint is studied in this paper. By a deteriorating job we mean that the processing time for the job is a function of its starting time. Even with the introduction o

Scheduling resumable simple linear deter
Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan
โœ Min Ji; T.C.E. Cheng ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 194 KB

## a b s t r a c t We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. Th

Minimizing makespan on a single batching
Minimizing makespan on a single batching machine with release times and non-identical job sizes
โœ Shuguang Li; Guojun Li; Xiaoli Wang; Qiming Liu ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 214 KB

We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2 + , where ยฟ 0 can be made arbitrarily small.