《Single machine rescheduling with new jobs arrivals and processing time compression-2016》.pdf

Int J Adv Manuf Technol (2007) 34: 378–384 DOI 10.1007/s00170-006-0590-7 ORIGINAL ARTICLE Bibo Yang Single machine rescheduling with new jobs arrivals and processing time compression Received: 8 January 2004 / Accepted: 8 August 2005 / Published online: 1 June 2006 # Springer-Verlag London Limited 2006 Abstract We consider job rescheduling problems where gency orders come in occasionally and the firm can use rescheduling is required in response to newly arriving jobs. additional resources to complete the emergency orders. To reduce the negative impacts of disruptions to the We assume that the firm utilizes a primary measure of original schedule, the processing times of the newly efficiency in scheduling jobs, such as the minimum total arriving jobs can be reduced at a cost, which we call a flow time or minimum weighted tardiness. In addition to time compression cost. The objective of the problem is to this primary efficiency measure, the firm is also concerned minimize total cost after rescheduling, which includes about disruption costs incurred as a result of schedule schedule disruption costs, time compression related costs, changes in response to newly arriving jobs. and a cost that depends on a traditional measure of schedule The problems we consider are single machine resched- efficiency. We separately consider two different measures uling problems with compression time and without of schedule efficiency: total completion time and weighted preemption, which are defined as follows. An original tardiness, and present polynomial time algorithms for the schedule exists for some nO original jobs. Each job i has total completion time case. For the weighted t