Skip to main content

To Calculate the Sequence-Dependent Setup Time for a Single-Machine Problem with Uncertain Job Arriving Time

  • Conference paper
Global Perspective for Competitive Enterprise, Economy and Ecology

Part of the book series: Advanced Concurrent Engineering ((ACENG))

Abstract

Consider a finite-capacity single machine responsible for processing several product types of jobs, in which the inter-arrival time of jobs of specific type is independently and exponentially distributed to reflect the uncertainties in market demand. Since the uncertainties of the time and the type of customer demand make the machine setup decision very complicated, the development of analytic models to calculate the expected sequencedependent setup time under FIFO and FSR rules contributes to the quick evaluation of capacity waste due to changing machine setting. Analytic model also shows the saving of machine utilization rate by changing the considered dispatching rule from FIFO to FSR.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

To Calculate the Sequence-Dependent Setup Time for a Single-Machine Problem 15

  1. Jensen JB, Malhotra MK. Philipoom PR, Family-based scheduling of shops with functional layouts. International Journal of Production Research 1998;36:2687-2700.

    Article  MATH  Google Scholar 

  2. Kannan VR, Lyman SB. Impact of family-based scheduling on transfer batches in a job shop manufacturing cell. International Journal of Production Research 1994;32:2777- 2794.

    Article  MATH  Google Scholar 

  3. Nomden G, Van Der Zee DJ, Slomp J. Family-based dispatching: anticipacting future jobs. International Journal of Production Research 2008;46:73-97.

    Article  MATH  Google Scholar 

  4. Allahverdi A, Gupta JND, Aldowaisan T. A review of scheduling research involving setup considerations. Omega 1999;27:219-239.

    Article  Google Scholar 

  5. Chern CC, Liu YL. Family-based scheduling rules of a sequence-dependent wafer fabrication system. IEEE Transactions on Semiconductor Manufacturing 2003;16:15- 25.

    Article  Google Scholar 

  6. Vieira GME, Herrmann JW, Lin E. Analytical models to predict the performance of a single machine system under periodic and event-driven rescheduling strategies. International Journal of Production Research 2000;38:1899-1915.

    Article  MATH  Google Scholar 

  7. Vieira GME, Herrmann JW, Lin E. Predicting the performance of rescheduling strategies for parallel machine systems. Journal of Manufacturing Systems 2000;19:256-266.

    Article  Google Scholar 

  8. Missbauer H. Order release and sequence-dependent setup times. International Journal of Production Economics 1997;49:131-143.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ming-Hsien Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer London

About this paper

Cite this paper

Yang, MH., Chung, SH., Kao, CK. (2009). To Calculate the Sequence-Dependent Setup Time for a Single-Machine Problem with Uncertain Job Arriving Time. In: Chou, SY., Trappey, A., Pokojski, J., Smith, S. (eds) Global Perspective for Competitive Enterprise, Economy and Ecology. Advanced Concurrent Engineering. Springer, London. https://doi.org/10.1007/978-1-84882-762-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-762-2_1

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-761-5

  • Online ISBN: 978-1-84882-762-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics