Bicriterion scheduling with equal processing times on a batch processing machine

Authors:
L. L. Liu;C. T. Ng;T. C. E. Cheng
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Computers and Operations Research
Year:
2009

Citing 6
Cited 2

Scheduling unit processing time jobs on a single machine with multiple criteria

Computers and Operations Research
A shortest augmenting path algorithm for the semi-assignment problem

Operations Research
Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms
Minimizing flowtime and missed due-dates in single-machine sequencing

Mathematical and Computer Modelling: An International Journal
Efficient scheduling algorithms for a single batch processing machine

Operations Research Letters

Parallel machine problems with equal processing times: a survey

Journal of Scheduling
Research on computational intelligence algorithms with adaptive learning approach for scheduling problems with batch processing machines

Neurocomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial time algorithms for various combinations of the primary and secondary criteria.