A revision of machine scheduling problems with a general learning effect

Authors:
Ji-Bo Wang;Ming-Zheng Wang
Affiliations:
Operations Research and Cybernetics Institute, School of Science, Shenyang Aerospace University, Shenyang 110136, China;School of Management, Dalian University of Technology, Dalian 116024, China
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2011

Citing 2
Cited 1

Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Machine scheduling problems with a general learning effect

Mathematical and Computer Modelling: An International Journal

A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects

Information Sciences: an International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

In this paper, we show that the main results in a recent paper by Zhang and Yan [X. Zhang and G. Yan, Machine scheduling problems with a general learning effect, Mathematical and Computer Modelling 51 (2010) 84-90] are incorrect as an important reason is missing, that is, the processing time of a job is variable according to a general learning effect. Here we point out these wrong results by a counter-example. In addition, we give a revised model with a general learning effect. We show that some single machine scheduling problems are still polynomially solvable under the revised model. We also show that some special cases of the flowshop scheduling problems can be solved in polynomial time under the revised model.