Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents

Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents

We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive th...

Full description

Saved in:
Bibliographic Details
Main Authors: Wen-Chiung Lee, Yau-Ren Shiau, Yu-Hsiang Chung, Lawson Ding
Format: Article
Language:English
Published: Wiley 2014-01-01
Series:The Scientific World Journal
Online Access:http://dx.doi.org/10.1155/2014/596306
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items