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

Single-machine group scheduling with linearly decreasing time-dependent setup times and job processing times

โœ Scribed by Ji-Bo Wang; Linyan Sun

Publisher
Springer
Year
2009
Tongue
English
Weight
264 KB
Volume
49
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Single machine scheduling with past-sequ
Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs
โœ Chuanli Zhao; Hengyong Tang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 180 KB

This paper considers single machine scheduling problems with setup times and deteriorating jobs. The setup times are proportional to the length of the already processed jobs, that is, the setup times are past-sequence-dependent (p-s-d). It is assumed that the job processing times are defined by func

Scheduling jobs on parallel machines wit
Scheduling jobs on parallel machines with sequence-dependent setup times
โœ Young Hoon Lee; Michael Pinedo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 855 KB

Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the

A generalized two-machine flowshop sched
A generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-time
โœ Dar-Li Yang; Maw-Sheng Chern ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 192 KB

We consider a two-machine ยฏowshop scheduling problem where the processing times are linearly dependent on the waiting times of the jobs. The objective is to minimize the makespan. A 0ยฑ1 mixed integer program and a heuristic algorithm are proposed. Some cases solved in polynomial time and computation