Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

Authors:
Dariusz Dereniowski;Wiesław Kubiak
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology, Gdańsk, Poland;Faculty of Business Administration, Memorial University, St. John's, Canada
Venue:
Journal of Scheduling
Year:
2010

Citing 8
Cited 2

Precoloring extension. I: Interval graphs

Discrete Mathematics - Special volume (part 1) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs”
On the k-coloring of intervals

Discrete Applied Mathematics
Scheduling computer and manufacturing processes

Scheduling computer and manufacturing processes
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

Computers and Operations Research
Simple Algorithms for Gilmore–Gomory's Traveling Salesman and Related Problems

Journal of Scheduling
A Heuristic Algorithm for One-Machine Just-In-Time Scheduling Problem with Periodic Time Slots

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Fairness Measures for Resource Allocation

SIAM Journal on Computing
Algorithm for Multislot Just-in-Time Scheduling on Identical Parallel Machines

ICICIC '07 Proceedings of the Second International Conference on Innovative Computing, Informatio and Control

A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria

Computers and Operations Research
Routing equal-size messages on a slotted ring

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper addresses the problem of multi-slot just-in-time scheduling. Unlike the existing literature on this subject, it studies a more general criterion--the minimization of the schedule makespan rather than the minimization of the number of slots used by schedule. It gives an O(nlog驴2 n)-time optimization algorithm for the single machine problem. For arbitrary number of m1 identical parallel machines it presents an O(nlog驴n)-time optimization algorithm for the case when the processing time of each job does not exceed its due date. For the general case on m1 machines, it proposes a polynomial time constant factor approximation algorithm.