Please use this identifier to cite or link to this item:
Title: Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
Authors: Yin, YQ
Cheng, TCE 
Wang, DJ
Wu, CC
Keywords: Two-agent scheduling
Bicriterion analysis
Two-dimensional FPTAS
Issue Date: 2017
Publisher: Springer
Source: Journal of scheduling, 2017, v. 20, no. 4, p. 313-335 How to cite?
Journal: Journal of scheduling 
Abstract: We consider the scheduling problem in which two agents (agents A and B), each having its own job set (containing the A-jobs and B-jobs, respectively), compete to process their own jobs in a two-machine flowshop. Each agent wants to maximize a certain criterion depending on the completion times of its jobs only. Specifically, agent A desires to maximize either the weighted number of just-in-time (JIT) A-jobs that are completed exactly on their due dates or the maximum weight of the JIT A-jobs, while agent B wishes to maximize the weighted number of JIT B-jobs. Evidently four optimization problems can be formulated by treating the two agents' criteria as objectives and constraints of the corresponding optimization problems. We focus on the problem of finding the Pareto-optimal schedules and present a bicriterion analysis of the problem. Solving this problem also solves the other three problems of bicriterion scheduling as a by-product. We show that the problems under consideration are either polynomially or pseudo-polynomially solvable. In addition, for each pseudo-polynomial-time solution algorithm, we show how to convert it into a two-dimensional fully polynomial-time approximation scheme for determining an approximate Pareto-optimal schedule. Finally, we conduct extensive numerical studies to evaluate the performance of the proposed algorithms.
ISSN: 1094-6136
EISSN: 1099-1425
DOI: 10.1007/s10951-017-0511-7
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Dec 13, 2018


Last Week
Last month
Citations as of Dec 15, 2018

Page view(s)

Citations as of Dec 16, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.