On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs

Authors:
Ruyan Fu;Ji Tian;Jinjiang Yuan
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, People's Republic of China 450052;Department of Mathematics, Zhengzhou University, Zhengzhou, People's Republic of China 450052;Department of Mathematics, Zhengzhou University, Zhengzhou, People's Republic of China 450052
Venue:
Journal of Scheduling
Year:
2009

Citing 5
Cited 2

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Scheduling a batch processing machine with incompatible job families

Computers and Industrial Engineering
Minimizing Makespan in Batch Machine Scheduling

Algorithmica
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Theoretical Computer Science
On-line scheduling on a batch machine to minimize makespan with limited restarts

Operations Research Letters

Online scheduling on unbounded parallel-batch machines with incompatible job families

Theoretical Computer Science
Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a tabu search heuristic for a production scheduling problem with sequence-dependent and time-dependent setup times on a single machine. The problem consists in scheduling a set of dependent jobs, where the transition between two ...