Loading...

Due date assignment in single machine with stochastic processing times

Elyasi, A ; Sharif University of Technology | 2013

916 Viewed
  1. Type of Document: Article
  2. DOI: 10.1080/00207543.2012.737945
  3. Publisher: 2013
  4. Abstract:
  5. This paper considers two different due date assignment and sequencing problems in single machine where the processing times of jobs are random variables. The first problem is to minimise the maximum due date so that all jobs are stochastically on time. It is shown that sequencing the jobs in decreasing service level (DSL) order optimally solves the problem. The results are then extended for two special cases of flow shop problem. The other problem is to minimise a total cost function which is a linear combination of three penalties: penalty on job earliness, penalty on job tardiness, and penalty associated with long due date assignment. The assignment of a common due date and distinct due dates are investigated for this problem. It is shown that the optimal sequence for the case of common due date is V-shaped
  6. Keywords:
  7. Common due date ; Due dates ; Due-date assignment ; Earliness ; Flow shop problems ; Job tardiness ; Linear combinations ; Optimal sequence ; Processing time ; Sequencing problems ; Service levels ; Single- machines ; Stochastic processing time ; Stochastic scheduling ; Tardiness ; Total cost function ; Random processes ; Stochastic systems
  8. Source: International Journal of Production Research ; Volume 51, Issue 8 , 2013 , Pages 2352-2362 ; 00207543 (ISSN)
  9. URL: http://www.tandfonline.com/doi/abs/10.1080/00207543.2012.737945