Single machine multiple common due dates scheduling with learning effects

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 Science and Engineering, Dalian University of Technology, Dalian 116024, China
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 2
Cited 4

Sequencing with earliness and tardiness penalties: a review

Operations Research
A single machine model for determination of optimal due dates and sequence

Operations Research

Some single-machine and flowshop scheduling problems with a non-linear deterioration function

Computers & Mathematics with Applications
Short Communication: A note on "Single machine scheduling with time-dependent deterioration and exponential learning effect"

Computers and Industrial Engineering
Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints

Computers & Mathematics with Applications
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.09

Visualization

Abstract

In this paper, we consider the problem of simultaneous determination of optimal due dates and optimal schedule for the single machine problem with multiple common due dates. The penalty for a job is assumed to be a linear function of the due date and the earliness/tardiness for the job. The objective function is to minimize the total penalty for all jobs. We show that with the introduction of learning to job processing times the problem remains polynomially solvable for a given number of multiple common due dates.