Skip to main content
SpringerLink
Log in

A two-agent single-machine scheduling problem with late work criteria

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper addresses a two-agent scheduling problem where the objective is to minimize the total late work of the first agent, with the restriction that the maximum lateness of the second agent cannot exceed a given value. Two pseudo-polynomial dynamic programming algorithms are presented to find the optimal solutions for small-scale problem instances. For medium- to large-scale problem instances, a branch-and-bound algorithm incorporating the implementation of a lower bounding procedure, some dominance rules and a Tabu Search-based solution initialization, is developed to yield the optimal solution. Computational experiments are designed to examine the efficiency of the proposed algorithms and the impacts of all the relative parameters.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  • Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52:229–242

    Article  MathSciNet  MATH  Google Scholar 

  • Agnetis A, Pascale G, Pacciarelli D (2009) A Lagrangian approach to single-machine scheduling problems with two competing agents. J Sched 12:401–415

    Article  MathSciNet  MATH  Google Scholar 

  • Baker KR, Smith JC (2003) A multiple criterion model for machine scheduling. J Sched 6:7–16

    Article  MathSciNet  MATH  Google Scholar 

  • Blazewicz J (1984) Scheduling preemptible tasks on parallel processors with information loss. Tech Sci Inform 3(6):415–420

    MathSciNet  MATH  Google Scholar 

  • Blazewicz J, Pesch E, Sterna M, Werner F (1999) Total late work criteria for shop scheduling problems. In: Inderfurth K, Schwödiauer G, Domschke W, Juhnke F, Kleinschmidt P, Waescher G (eds) Operations research proceedings. Springer, Berlin, pp 354–359

  • Blazewicz J, Pesch E, Sterna M, Werner F (2004) Open shop scheduling problems with late work criteria. Discret Appl Math 134:1–24

    Article  MathSciNet  MATH  Google Scholar 

  • Cheng TCE, Cheng SR, Wu WH, Hsu PH, Wu CC (2011) A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations. Comput Ind Eng 60:534–541

    Article  Google Scholar 

  • Gerstl E, Mosheiov G (2012) Scheduling problems with two competing agents to minimize weighted earliness-tardiness. Comput Oper Res 40:109–116

    Article  MATH  Google Scholar 

  • Guo P, Cheng W, Wang Y (2014) A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs. J Ind Manag Optim 10(4):1071–1090

    Article  MathSciNet  MATH  Google Scholar 

  • Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8(1):156–166

    Article  Google Scholar 

  • Glover F (1989) Tabu search—part I. INFORMS J Comput 1(3):190–206

    Article  MathSciNet  MATH  Google Scholar 

  • Hall NG, Posner ME (2001) Generating experimental data for computation testing with machine scheduling applications. Oper Res 8:54–865

    MATH  Google Scholar 

  • Ke H, Ma J (2014) Modeling project time-cost trade-off in fuzzy random environment. Appl Soft Comput 19:80–85

    Article  Google Scholar 

  • Lee WC, Chen SK, Chen WC, Wu CC (2011) A two-machine flowshop problem with two agents. Comput Oper Res 38:98–104

    Article  MathSciNet  MATH  Google Scholar 

  • Lee K, Choi BC, Leung JYT, Pinedo ML (2009) Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. Inf Process Lett 109:913–917

    Article  MathSciNet  MATH  Google Scholar 

  • Leung JYT, Pinedo M, Wan G (2010) Competitive two-agent scheduling and its applications. Oper Res 58:458–469

    Article  MathSciNet  MATH  Google Scholar 

  • Li S, Yuan J (2012) Unbounded parallel-batching scheduling with two competitive agents. J Sched 15:629–640

    Article  MathSciNet  MATH  Google Scholar 

  • Liao LM, Huang CJ (2011) Tabu search heuristic for two-machine flowshop with batch processing machines. Comput Ind Eng 60:426–432

    Article  Google Scholar 

  • Lin BMT, Hsu SW (2005) Minimizing total late work on a single machine with release and due dates, In: SIAM conference on computational science and engineering, Orlando

  • Liu P, Yi N, Zhou XY (2011) Two-agent single-machine scheduling problems under increasing linear deterioration. Appl Math Model 35:2290–2296

    Article  MathSciNet  MATH  Google Scholar 

  • Li J, Pan Q, Wang F (2014) A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem. Appl Soft Comput 24:63–77

    Article  Google Scholar 

  • Li G, Lu X (2015) Two-machine scheduling with periodic availability constraints to minimize makespan. J Ind Manag Optim 11(2):685–700

    Article  MathSciNet  MATH  Google Scholar 

  • Mor B, Mosheiov G (2010) Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. Eur J Oper Res 206:540–546

    Article  MathSciNet  MATH  Google Scholar 

  • Mor B, Mosheiov G (2011) Single machine batch scheduling with two competing agents to minimize total flowtime. Eur J Oper Res 215:524–531

    Article  MathSciNet  MATH  Google Scholar 

  • Ng CT, Cheng TCE, Yuan JJ (2006) A note on the complexity of the two-agent scheduling on a single machine. J Comb Optim 12:387–394

    Article  MathSciNet  MATH  Google Scholar 

  • Potts CN, Van Wassenhove LN (1991a) Single machine scheduling to minimize total late work. Oper Res 40:586–595

  • Potts CN, Van Wassenhove LN (1991b) Approximation algorithms for scheduling a single machine to minimize total late work. Oper Res Lett 11:261–266

  • Pei J, Pardalos PM, Liu X, Fan W, Yang S, Wang L (2015) Coordination of production and transportation in supply chain scheduling. J Ind Manag Optim 11(2):399–419

    MathSciNet  MATH  Google Scholar 

  • Ren J, Zhang Y, Sun G (2009) The NP-hardness of minimizing the total late work on an unbounded batch machine. Asia-Pac J Oper Res 26(3):351–363

    Article  MathSciNet  MATH  Google Scholar 

  • Roy PK, Bhui S, Paul C (2014) Solution of economic load dispatch using hybrid chemical reaction optimization approach. Appl Soft Comput 24:109–125

    Article  Google Scholar 

  • Sterna M (2007) Dominance relations for two-machine flow shop problem with late work criterion. Bull Pol Acad Sci 55:59–69

    MATH  Google Scholar 

  • Sterna M (2011) A survey of scheduling problems with late work criteria. Omega 39:120–129

    Article  Google Scholar 

  • Tuong NH, Soukhal A, Billaut JC (2012) Single-machine multi-agent scheduling problems with a global objective function. J Sched 15:311–332

    Article  MathSciNet  MATH  Google Scholar 

  • Wan G, Vakati RS, Leung JYT, Pinedo M (2010) Scheduling two agents with controllable processing times. Eur J Oper Res 205:528–539

    Article  MathSciNet  MATH  Google Scholar 

  • Wu W-H, Yin Y, Wu W-H, Wu C-C, Hsu P-H (2014) A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents. J Ind Manag Optim 10(2):591–611

    Article  MathSciNet  MATH  Google Scholar 

  • Yin Y, Cheng SR, Cheng TCE, Wu CC, Wu WH (2012a) Two-agent single-machine scheduling with assignable due dates. Appl Math Comput 219:1674–1685

  • Yin Y, Cheng SR, Cheng TCE, Wu WH, Wu CC (2013a) Two-agent single-machine scheduling with release times and deadlines. Int J Shipp Transp Logist 5:75–94

  • Yin Y, Cheng SR, Wu CC (2012b) Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties. Inf Sci 189:282–292

  • Yin Y, Wu C-C, Wu W-H, Hsu C-J, Wu W-H (2013b) A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents. Appl Soft Comput 13(2):1042–1054

  • Yuan X, Ji B, Zhang S, Tian H, Hou Y (2014) A new approach for unit commitment problem via binary gravitational search algorithm. Appl Soft Comput 22:249–260

    Article  Google Scholar 

  • Zhao K, Lu X (2013) Approximation schemes for two-agent scheduling on parallel machines. Theor Comput Sci 468:114–121

    Article  MathSciNet  MATH  Google Scholar 

  • Zhao CL, Yin Y, Cheng TCE, Wu C-C (2014) Single-machine scheduling and due date assignment with rejection and position-dependent processing times. J Ind Manag Optim 10(3):691–700

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

We thank the Editor, Associate Editor, and anonymous referees for their helpful comments on the earlier version of our paper. This paper was supported in part by the National Natural Science Foundation of China (No. 71501024); in part by the Ministry of Science Technology of Taiwan (Nos. NSC 102-2221-E-035-070-MY3, MOST 103-2410- H- 035- 022- MY2), and by Fundamental Research Funds for the Central Universities under Grant DUT15QY32.

Author information

Authors and Affiliations

  1. School of Management Science and Engineering, Dalian University of Technology, Dalian, 116023, China

    Du-Juan Wang

  2. Department of Business Administration, Graduate Institute of Management, Providence University, Shalu, Taichung, Taiwan

    Chao-Chung Kang

  3. Department of Industrial Engineering and System Management, Feng-Chia University, Taichung, Taiwan

    Yau-Ren Shiau

  4. Department of Statistics, Feng Chia University, Taichung, Taiwan

    Chin-Chia Wu

  5. Department of Business Administration, Kang Ning University, Taipei, Taiwan

    Peng-Hsiang Hsu

Authors
  1. Du-Juan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chao-Chung Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yau-Ren Shiau
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chin-Chia Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Peng-Hsiang Hsu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peng-Hsiang Hsu.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interests regarding the publication of this paper.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, DJ., Kang, CC., Shiau, YR. et al. A two-agent single-machine scheduling problem with late work criteria. Soft Comput 21, 2015–2033 (2017). https://doi.org/10.1007/s00500-015-1900-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-015-1900-5

Keywords

Search

Navigation