Skip to main content
SpringerLink
Log in

Earliness and tardiness single machine scheduling with proportional weights

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This paper presents the first efficient method to solve an earliness-tardiness single machine n job scheduling model with idle times permitted. In this model the earliness and tardiness penalties are proportional to the processing times of the jobs. A two stage decomposition process builds the optimal job arrangement as a sequence of single and multijob blocks. The arrangement of the jobs within each multijob block is unspecified since it depends on the start time of this block. This process is followed by a procedure that drastically reduces the number of candidate optimal n job sequences. Finally an available optimal timing algorithm is recommended and implemented to select the best schedule among those sequences. The solution procedure tested on a PC on 400 examples for n=40 and 50 proves to be very fast.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E.M.Arkin and R.O.Roundy, “Weighted Tardiness Scheduling on Parallel Machines with Proportional Weights,” Operations Research, 39, 64–81 (1991).

    Google Scholar 

  2. M.R.Garey, R.E.Tarjan, and G.T.Wilfong, “One Processor Scheduling with Symmetric Earliness and Tardiness Penalties,” Mathematics of Operations Research 13, 330–348 (1988).

    Google Scholar 

  3. J.S.Davis and J.J.Kanet, “Single-Machine Scheduling with Early and Tardy Completion Costs,” Naval Research Loqistics, 40 (1993), 85–101.

    Google Scholar 

  4. R.Rachamadugu, “Scheduling Jobs Against a Common Due Date,” Working Paper #631, School of Business Administration, The University of Michigan, Ann Arbor, Michigan 48109 (1990).

    Google Scholar 

  5. W.Szwarc and J.J.Liu, “Weighted Tardiness Single Machine Scheduling with Proportional Weights,” Management Science, 39, 626–632 (1993).

    Google Scholar 

  6. W. Szwarc and S.K. Mukhopadhyay, “Optimal Timing Schedules in Earliness-Tardiness Single Machine Sequencing,” to appear in Naval Research Loqistics.

  7. C.A.Yano and Y-DKim, “Algorithms for a Class of Single-Machine Weighted Tardiness and Earliness Problems,” European Journal of Operational Research 52, 167–178 (1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business Administration, University of Wisconsin-Milwaukee, P. O. Box 742, 53201, Milwaukee, WI, USA

    Wlodzimierz Szwarc & Samar K. Mukhopadhyay

Authors
  1. Wlodzimierz Szwarc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Samar K. Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Szwarc, W., Mukhopadhyay, S.K. Earliness and tardiness single machine scheduling with proportional weights. J Glob Optim 9, 227–238 (1996). https://doi.org/10.1007/BF00121673

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00121673

Keywords

Search

Navigation