IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v46y2015i7p1246-1256.html
   My bibliography  Save this article

Due-date assignment for multi-server multi-stage assembly systems

Author

Listed:
  • Saeed Yaghoubi

Abstract

In this paper, we attempt to present a constant due-date assignment policy in a multi-server multi-stage assembly system. This system is modelled as a queuing network, where new product orders are entered into the system according to a Poisson process. It is assumed that only one type of product is produced by the production system and multi-servers can be settled in each service station. Each operation of every work is operated at a devoted service station with only one of the servers located at a node of the network based on first come, first served (FCFS) discipline, while the processing times are independent random variables with exponential distributions. It is also assumed that the transport times between each pair of service stations are independent random variables with generalised Erlang distributions. Each product's end result has a penalty cost that is some linear function of its due date and its actual lead time. The due date is calculated by adding a constant to the time that the order enters into the system. Indeed, this constant value is decided at the beginning of the time horizon and is the constant lead time that a product might expect between the time of placing the order and the time of delivery. For computing the due date, we first convert the queuing network into a stochastic network with exponentially distributed arc lengths. Then, by constructing an appropriate finite-state continuous-time Markov model, a system of differential equations is created to find the manufacturing lead-time distribution for any particular product, analytically. Finally, the constant due date for delivery time is obtained by using a linear function of its due date and minimising the expected aggregate cost per product.

Suggested Citation

  • Saeed Yaghoubi, 2015. "Due-date assignment for multi-server multi-stage assembly systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(7), pages 1246-1256, May.
    • Handle: RePEc:taf:tsysxx:v:46:y:2015:i:7:p:1246-1256
    DOI: 10.1080/00207721.2013.815826
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2013.815826
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2013.815826?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. James K. Weeks, 1979. "A Simulation Study of Predictable Due-Dates," Management Science, INFORMS, vol. 25(4), pages 363-373, April.
    2. Liu, Xiao-Gao & Buzacott, John A., 1990. "Approximate models of assembly systems with finite inventory banks," European Journal of Operational Research, Elsevier, vol. 45(2-3), pages 143-154, April.
    3. John Dumond & Vincent A. Mabert, 1988. "Evaluating Project Scheduling and Due Date Assignment Procedures: An Experimental Analysis," Management Science, INFORMS, vol. 34(1), pages 101-118, January.
    4. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    5. C. H. Jones, 1973. "An Economic Evaluation of Job Shop Dispatching Rules," Management Science, INFORMS, vol. 20(3), pages 293-307, November.
    6. Biskup, Dirk & Jahnke, Hermann, 2001. "Common due date assignment for scheduling on a single machine with jointly reducible processing times," International Journal of Production Economics, Elsevier, vol. 69(3), pages 317-322, February.
    7. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    8. James K. Weeks & John S. Fryer, 1977. "A Methodology for Assigning Minimum Cost Due-Dates," Management Science, INFORMS, vol. 23(8), pages 872-881, April.
    9. S. S. Panwalkar & M. L. Smith & A. Seidmann, 1982. "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, INFORMS, vol. 30(2), pages 391-399, April.
    10. Perkgoz, Cahit & Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2007. "A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 180(1), pages 292-308, July.
    11. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.
    12. George Steiner & Rui Zhang, 2011. "Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries," Annals of Operations Research, Springer, vol. 191(1), pages 171-181, November.
    13. Abraham Seidmann & Milton L. Smith, 1981. "Due Date Assignment for Production Systems," Management Science, INFORMS, vol. 27(5), pages 571-581, May.
    14. Liu, Liming & Yuan, Xue-Ming, 2001. "Throughput, flow times, and service level in an unreliable assembly system," European Journal of Operational Research, Elsevier, vol. 135(3), pages 602-615, December.
    15. T C E Cheng & L Kang & C T Ng, 2004. "Due-date assignment and single machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 198-203, February.
    16. Yuan, Xue-Ming & Liu, Liming, 2005. "Performance analysis of assembly systems with unreliable machines and finite buffers," European Journal of Operational Research, Elsevier, vol. 161(3), pages 854-871, March.
    17. Gordon, Valery S. & Strusevich, Vitaly A., 2009. "Single machine scheduling and due date assignment with positionally dependent processing times," European Journal of Operational Research, Elsevier, vol. 198(1), pages 57-62, October.
    18. Lee, Jae Kyu & Lee, Kyoung Jun & Park, Hung Kook & Hong, June Seok & Lee, Jung Seung, 1997. "Developing scheduling systems for Daewoo Shipbuilding: DAS project," European Journal of Operational Research, Elsevier, vol. 97(2), pages 380-395, March.
    19. V. G. Kulkarni & V. G. Adlakha, 1986. "Markov and Markov-Regenerative pert Networks," Operations Research, INFORMS, vol. 34(5), pages 769-781, October.
    20. Cheng, T. C. E. & Gupta, M. C., 1989. "Survey of scheduling research involving due date determination decisions," European Journal of Operational Research, Elsevier, vol. 38(2), pages 156-166, January.
    21. Vinod, V. & Sridharan, R., 2011. "Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 127-146, January.
    22. .Ilker Baybars, 1986. "A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem," Management Science, INFORMS, vol. 32(8), pages 909-932, August.
    23. Mosheiov, Gur & Sarig, Assaf, 2009. "Due-date assignment on uniform machines," European Journal of Operational Research, Elsevier, vol. 193(1), pages 49-58, February.
    24. Baker, Kenneth R. & Powell, Stephen G., 1995. "A predictive model for the throughput of simple assembly systems," European Journal of Operational Research, Elsevier, vol. 81(2), pages 336-345, March.
    25. Xia, Yu & Chen, Bintong & Yue, Jinfeng, 2008. "Job sequencing and due date assignment in a single machine shop with uncertain processing times," European Journal of Operational Research, Elsevier, vol. 184(1), pages 63-75, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. J-G Kim & D-H Lee, 2009. "Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1264-1272, September.
    2. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.
    3. Sang, Yao-Wen & Wang, Jun-Qiang & Sterna, Małgorzata & Błażewicz, Jacek, 2023. "Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work," Omega, Elsevier, vol. 121(C).
    4. Enns, S. T., 1998. "Lead time selection and the behaviour of work flow in job shops," European Journal of Operational Research, Elsevier, vol. 109(1), pages 122-136, August.
    5. Perkgoz, Cahit & Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2007. "A multi-objective lead time control problem in multi-stage assembly systems using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 180(1), pages 292-308, July.
    6. Song, D. P. & Hicks, C. & Earl, C. F., 2002. "Product due date assignment for complex assemblies," International Journal of Production Economics, Elsevier, vol. 76(3), pages 243-256, April.
    7. Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
    8. Du-Juan Wang & Yunqiang Yin & Shuenn-Ren Cheng & T.C.E. Cheng & Chin-Chia Wu, 2016. "Due date assignment and scheduling on a single machine with two competing agents," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1152-1169, February.
    9. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    10. Azaron, Amir & Fynes, Brian & Modarres, Mohammad, 2011. "Due date assignment in repetitive projects," International Journal of Production Economics, Elsevier, vol. 129(1), pages 79-85, January.
    11. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    12. Leyvand, Yaron & Shabtay, Dvir & Steiner, George, 2010. "A unified approach for scheduling with convex resource consumption functions using positional penalties," European Journal of Operational Research, Elsevier, vol. 206(2), pages 301-312, October.
    13. Qian, Jianbo & Steiner, George, 2013. "Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine," European Journal of Operational Research, Elsevier, vol. 225(3), pages 547-551.
    14. Pinar Keskinocak & R. Ravi & Sridhar Tayur, 2001. "Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues," Management Science, INFORMS, vol. 47(2), pages 264-279, February.
    15. Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
    16. Dvir Shabtay & George Steiner, 2008. "The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times," Annals of Operations Research, Springer, vol. 159(1), pages 25-40, March.
    17. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    18. Baruch Mor, 2019. "Minmax scheduling problems with common due-date and completion time penalty," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 50-71, July.
    19. Shabtay, Dvir & Mosheiov, Gur & Oron, Daniel, 2022. "Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work," European Journal of Operational Research, Elsevier, vol. 303(1), pages 66-77.
    20. Hui Zhu & Min Li & Zhangjin Zhou & Yun You, 2016. "Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3475-3490, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:46:y:2015:i:7:p:1246-1256. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.