Author： Min Xiao Wang Yuqing Liu Jing Jiang Min
Publisher： Springer Publishing Company
ISSN： 1382-6905
Source： Journal of Combinatorial Optimization, Vol.26, Iss.3, 2013-10, pp. : 472-479
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this paper we consider two semi-online scheduling problems with rejection on two identical machines. A sequence of independent jobs are given and each job is characterized by its size (processing time) and its penalty, in the sense that, jobs arrive one by one and can be either rejected by paying a certain penalty or assigned to some machine. No preemption is allowed. The objective is to minimize the sum of the makespan of schedule, which is yielded by all accepted jobs and the total penalties of all rejected ones. In the first problem one can reassign several scheduled jobs in rejection tache, in the second a buffer with length
Related content
On-line and semi-online scheduling for flow shop problems on two machines
Optimization, Vol. 62, Iss. 4, 2013-04 ,pp. :
Access to resources
Recommend
