Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
                                            Some full text articles may not yet be available without a charge during the embargo (administrative interval).
                                        
                                        
                                        
                                            
                                                
                                             What is a DOI Number?
                                        
                                    
                                
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
- 
            ABSTRACT We study the optimal sequencing of a batch of tasks on a machine subject to random disruptions driven by a non‐homogeneous Poisson process (NHPP), such that every disruption requires the interrupted task to be re‐processed from scratch, and partially completed work on a disrupted task is wasted. The NHPP models random disruptions whose frequency varies systematically with time. In general, the time taken to process a given batch of tasks depends on the order in which the tasks are processed. We find conditions under which the simplest possible sequencing rules—shortest processing time first (SPT) and longest processing time first (LPT)—suffice to minimize the completion time of a batch of tasks.more » « lessFree, publicly-accessible full text available June 1, 2026
- 
            Free, publicly-accessible full text available July 3, 2026
- 
            Free, publicly-accessible full text available April 1, 2026
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
 
                                     Full Text Available
                                                Full Text Available