Bicriteria Scheduling on Single-Machine with Inventory Operations

Authors:
Baoqiang Fan;Rongjun Chen;Guochun Tang
Affiliations:
Department of Mathematics and Information, Ludong University, Yantai, China 264025;Department of Mathematics, Changzhou Institute of Technology, Changzhou, China 213002;Institute of Management Engineering, Shanghai Second Polytechnic University, Shanghai, China 201209
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 5
Cited 0

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

Computers and Operations Research
Sequencing with earliness and tardiness penalties: a review

Operations Research
Earliness-tardiness scheduling problems: I. Weighted derivation of completion times about a common due date

Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Complexity of two dual criteria scheduling problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the single machine scheduling problem with inventory operations. The objective is to minimize makespan subject to the constraint that the total number of tardy jobs is minimum. We show the problem is strongly NP-hard. A polynomial (1 + 1/(m *** 1))-approximation scheme for the problem is presented, where m is defined as the total job's processing times *** p j divided by the capacity c of the storage, and an optimal algorithm for a special case of the problem, in which each job is one unit in size, is provided.