Soft Computing

, Volume 21, Issue 8, pp 2015–2033

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

  • Du-Juan Wang
  • Chao-Chung Kang
  • Yau-Ren Shiau
  • Chin-Chia Wu
  • Peng-Hsiang Hsu
Methodologies and Application

DOI: 10.1007/s00500-015-1900-5

Cite this article as:
Wang, DJ., Kang, CC., Shiau, YR. et al. Soft Comput (2017) 21: 2015. doi:10.1007/s00500-015-1900-5
  • 148 Downloads

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.

Keywords

Scheduling Two agent Dynamic programming Branch-and-bound algorithm 

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Du-Juan Wang
    • 1
  • Chao-Chung Kang
    • 2
  • Yau-Ren Shiau
    • 3
  • Chin-Chia Wu
    • 4
  • Peng-Hsiang Hsu
    • 5
  1. 1.School of Management Science and EngineeringDalian University of TechnologyDalianChina
  2. 2.Department of Business Administration, Graduate Institute of ManagementProvidence UniversityTaichungTaiwan
  3. 3.Department of Industrial Engineering and System ManagementFeng-Chia UniversityTaichungTaiwan
  4. 4.Department of StatisticsFeng Chia UniversityTaichungTaiwan
  5. 5.Department of Business AdministrationKang Ning UniversityTaipeiTaiwan

Personalised recommendations