Soft Computing

, Volume 21, Issue 3, pp 805–816

A two-agent single-machine scheduling problem to minimize the total cost with release dates

  • Du-Juan Wang
  • Yunqiang Yin
  • Wen-Hsiang Wu
  • Wen-Hung Wu
  • Chin-Chia Wu
  • Peng-Hsiang Hsu
Methodologies and Application

DOI: 10.1007/s00500-015-1817-z

Cite this article as:
Wang, DJ., Yin, Y., Wu, WH. et al. Soft Comput (2017) 21: 805. doi:10.1007/s00500-015-1817-z

Abstract

This paper considers a two-agent scheduling problem with arbitrary release dates on a single machine. The cost of the first agent is the maximum weighted completion time of its jobs while the cost of the second agent is the total weighted completion time of its jobs. The goal is to schedule the jobs such that the total cost of the two agents is minimized. The problem is known to be strongly NP-hard. Thus, as an alternative, a branch-and-bound algorithm incorporating several dominance properties and a lower bound is provided to derive the optimal solution and a largest- order-value method combined with proposed three initials is developed to derive the near-optimal solutions for the problem. Computational results are also presented to evaluate the performance of the proposed algorithms.

Keywords

Scheduling Two-agent Largest order value method Maximum weighted completion time 

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Du-Juan Wang
    • 1
  • Yunqiang Yin
    • 2
  • Wen-Hsiang Wu
    • 3
  • Wen-Hung Wu
    • 4
  • Chin-Chia Wu
    • 5
  • Peng-Hsiang Hsu
    • 4
  1. 1.School of Management Science and EngineeringDalian University of TechnologyDalianChina
  2. 2.Faculty of ScienceKunming University of Science and TechnologyKunmingChina
  3. 3.Department of Healthcare ManagementYuanpei UniversityHsinchuTaiwan
  4. 4.Department of Business AdministrationKang-Ning Junior College of Medical Care and ManagementTaipeiTaiwan
  5. 5.Department of StatisticsFeng Chia UniversityTaichungTaiwan

Personalised recommendations