View Item 

Show simple item record

Priority Rules for Multi‐Task Due‐Date Scheduling under Varying Processing Costs
dc.contributor.authorXu, Yunjian
dc.contributor.authorShi, Cong
dc.contributor.authorDuenyas, Izak
dc.date.accessioned2017-01-10T19:11:36Z
dc.date.available2018-02-01T14:56:11Zen
dc.date.issued2016-12
dc.identifier.citationXu, Yunjian; Shi, Cong; Duenyas, Izak (2016). "Priority Rules for Multi‐Task Due‐Date Scheduling under Varying Processing Costs." Production and Operations Management 25(12): 2086-2102.
dc.identifier.issn1059-1478
dc.identifier.issn1937-5956
dc.identifier.urihttps://hdl.handle.net/2027.42/135700
dc.publisherNorth Holland Publishing Company
dc.publisherWiley Periodicals, Inc.
dc.subject.otherpriority rule
dc.subject.othermake‐to‐order
dc.subject.othervarying processing costs
dc.subject.othermulti‐task due‐date scheduling
dc.titlePriority Rules for Multi‐Task Due‐Date Scheduling under Varying Processing Costs
dc.typeArticleen_US
dc.rights.robotsIndexNoFollow
dc.subject.hlbsecondlevelIndustrial and Operations Engineering
dc.subject.hlbtoplevelEngineering
dc.description.peerreviewedPeer Reviewed
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/135700/1/poms12606.pdf
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/135700/2/poms12606_am.pdf
dc.identifier.doi10.1111/poms.12606
dc.identifier.sourceProduction and Operations Management
dc.identifier.citedreferenceLeung, J. Y. T., H. Li, M. Pinedo. 2006. Scheduling orders for multiple product types with due date related objectives. Eur. J. Oper. Res. 168 ( 2 ): 370 – 389.
dc.identifier.citedreferenceGallego, G., Ö. Özer. 2001. Integrating replenishment decisions with advance demand information. Management Sci. 47 ( 10 ): 1344 – 1360.
dc.identifier.citedreferenceGoossens, J., S. Funk, S. Baruah. 2003. Priority‐driven scheduling of periodic task systems on multiprocessors. Real Time Syst. 25 ( 2 ): 187 – 205.
dc.identifier.citedreferenceGupta, D., L. Wang. 2007. Capacity management for contract manufacturing. Oper. Res. 55 ( 2 ): 367 – 377.
dc.identifier.citedreferenceHe, Q.‐M., E. M. Jewkes, J. Buzacott. 2002. The value of information used in inventory control of a make‐to‐order inventory‐production system. IIE Trans. 34 ( 11 ): 999 – 1013.
dc.identifier.citedreferenceHeath, D. C., P. L. Jackson. 1994. Modeling the evolution of demand forecasts with application to safety stock analysis in production/distribution system. IIE Trans. 26 ( 3 ): 17 – 30.
dc.identifier.citedreferenceIravani, S. M. R., T. Liu, D. Simchi‐Levi. 2012. Optimal production and admission policies in make‐to‐stock/make‐to‐order manufacturing systems. Prod. Oper. Manag. 21 ( 2 ): 224 – 235.
dc.identifier.citedreferenceKaminsky, P., O. Kaya. 2008. Scheduling and due‐date quotation in a make‐to‐order supply chain. Nav. Res. Log. 55 ( 5 ): 444 – 458.
dc.identifier.citedreferenceKeskinocak, P., S. Tayur. 2004. Due date management policies. D.   Simchi‐Levi, S. D. Wu, Z.‐J. Shen, eds. Handbook of Quantitative Supply Chain Analysis, International Series in Operations Research & Management Science, vol. 74. Springer, Boston, MA, 485 – 554.
dc.identifier.citedreferenceLeung, J. Y. T., Z. L. Chen. 2013. Integrated production and distribution with fixed delivery departure dates. Oper. Res. Lett. 41 ( 3 ): 290 – 293.
dc.identifier.citedreferenceLiu, C. L., J. W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard‐real‐time environment. J. ACM 20 ( 1 ): 46 – 61.
dc.identifier.citedreferenceLocke, C. D. 1986. Best‐effort decision‐making for real‐time scheduling. Ph.D Thesis, Carnegie Mellon University.
dc.identifier.citedreferenceMoyal, P. 2013. On queues with impatience: Stability, and the optimality of earliest deadline first. Queueing Syst. 75 ( 2–4 ): 211 – 242.
dc.identifier.citedreferencePanwar, S. S., D. Towsley, J. K. Wolf. 1988. Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service. J. ACM 35 ( 4 ): 832 – 844.
dc.identifier.citedreferencePhan, L. T., Z. Zhang, Q. Zheng, B. T. Loo, I. Lee. 2011. An empirical analysis of scheduling techniques for real‐time cloud‐based data processing. Proceedings of the 2011 IEEE International Conference on Service‐Oriented Computing and Applications. SOCA ’11, IEEE Computer Society, Washington, DC, USA, 1 – 8.
dc.identifier.citedreferencePinedo, M. 1983. Stochastic scheduling with release dates and due dates. Oper. Res. 31 ( 3 ): 559 – 572.
dc.identifier.citedreferencePundoor, G., Z. L. Chen. 2005. Scheduling a production‐distribution system to optimize the tradeoff between delivery tardiness and distribution cost. Nav. Res. Log. 52 ( 6 ): 571 – 589.
dc.identifier.citedreferenceStankovic, J. A., K. Ramamritham, M. Spuri. 1998. Deadline scheduling for real‐time systems: EDF and related algorithms. Kluwer Academic Publishers, Norwell, MA.
dc.identifier.citedreferenceYoussef, K. H., C. Van Delft, Y. Dallery. 2004. Efficient scheduling rules in a combined make‐to‐stock and make‐to‐order manufacturing system. Ann. Oper. Res. 126 ( 1–4 ): 103 – 134.
dc.identifier.citedreferenceZhao, X., K. E. Stecke, A. Prasad. 2012. Lead time and price quotation mode selection: Uniform or differentiated? Prod. Oper. Manag. 21 ( 1 ): 177 – 193.
dc.identifier.citedreferenceAfèche, P., O. Baron, Y. Kerner. 2013. Pricing time‐sensitive services based on realized performance. Manuf. Serv. Oper. Manag. 15 ( 3 ): 492 – 506.
dc.identifier.citedreferenceBaker, K. R., G. D. Scudder. 1990. Sequencing with earliness and tardiness penalties: A review. Oper. Res. 38 ( 1 ): 22 – 36.
dc.identifier.citedreferenceBenjaafar, S., W. L. Cooper, S. Mardan. 2011. Production‐inventory systems with imperfect advance demand information and updating. Nav. Res. Log. 58 ( 2 ): 88 – 106.
dc.identifier.citedreferenceBuchbinder, N., T. Kimbrel, R. Levi, K. Makarychev, M. Sviridenko. 2013. Online make‐to‐order joint replenishment model: Primal‐dual competitive algorithms. Oper. Res. 61 ( 4 ): 1014 – 1029.
dc.identifier.citedreferenceBülbül, K., P. Kaminsky, C. Yano. 2007. Preemption in single machine earliness/tardiness scheduling. J. Sched. 10 ( 4–5 ): 271 – 292.
dc.identifier.citedreferenceButtazzo, G., M. Spuri, F. Sensini. 1995. Value vs. deadline scheduling in overload conditions. Proceedings of the 1995 IEEE Real‐Time Systems Symposium. Pisa, Italy, 90 – 99.
dc.identifier.citedreferenceCarr, S., I. Duenyas. 2000. Optimal admission control and sequencing in a make‐to‐stock/make‐to‐order production system. Oper. Res. 48 ( 5 ): 709 – 720.
dc.identifier.citedreferenceChen, Z. L. 2010. Integrated production and outbound distribution scheduling: Review and extensions. Oper. Res. 58 ( 1 ): 130 – 148.
dc.identifier.citedreferenceChen, C. C., Y. Yih. 1996. Indentifying attributes for knowledge‐based development in dynamic scheduling environments. Int. J. Prod. Res. 34 ( 6 ): 1739 – 1755.
dc.identifier.citedreferenceCheng, T. C. E., M. C. Gupta. 1989. Survey of scheduling research involving due date determination decisions. Eur. J. Oper. Res. 38 ( 2 ): 156 – 166.
dc.identifier.citedreferenceDavis, R. I., A. Burns. 2011. A survey of hard real‐time scheduling for multiprocessor systems. ACM Comput. Surv. 43 ( 4 ): 35:1 – 35:44.
dc.identifier.citedreferenceDellaert, N. P., M. T. Melo. 1995. Heuristic procedures for a stochastic lot‐sizing problem in make‐to‐order manufacturing. Ann. Oper. Res. 59 ( 1 ): 227 – 258.
dc.identifier.citedreferenceDertouzos, M. 1974. Control robotics: The procedural control of physical processes. J. L. Rosenfeld, ed. Proceedings of IFIP Congress. North Holland Publishing Company, Stockholm, Sweden, 807 – 813.
dc.identifier.citedreferenceDobson, G., C. A. Yano. 2002. Product offering, pricing, and make‐to‐stock/make‐to‐order decisions with shared capacity. Prod. Oper. Manag. 11 ( 3 ): 293 – 312.
dc.identifier.citedreferenceDoytchinov, B., J. Lehoczky, S. Shreve. 2001. Real‐time queues in heavy traffic with earliest‐deadline‐first queue discipline. Ann. Appl. Prob. 11 ( 2 ): 332 – 378.
dc.identifier.citedreferenceDraper, N. R., H. Smith. 2014. Applied regression analysis, 3rd edn. John Wiley & Sons, New York.
dc.identifier.citedreferenceDuenyas, I., M. P. Van Oyen. 1996. Heuristic scheduling of parallel heterogeneous queues with set‐ups. Management Sci. 42 ( 6 ): 814 – 829.
dc.identifier.citedreferenceFarzan, A., M. Ghodsi. 2002. New results for lazy bureaucrat scheduling problem. Proceedings of the 7th CSI Computer Conference. CSICC ‘02, Iran Telecommunication Research Center, Tehran, Iran, 66 – 71.
dc.identifier.citedreferenceFedergruen, A., G. Mosheiov. 1997. Single machine scheduling problems with general breakdowns, earliness and tardiness costs. Oper. Res. 45 ( 1 ): 66 – 71.
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
poms12606.pdf
Size:
408.6KB
Format:
PDF
View/Open
Name:
poms12606_am.pdf
Size:
414.7KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.