An approach to solve a hierarchical stochastic sequential ordering problem
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Gutjahr, W. J. & Hellmayr, A. & Pflug, G. Ch., 1999. "Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound," European Journal of Operational Research, Elsevier, vol. 117(2), pages 396-413, September.
- Forst, Frank G., 1995. "Bicriterion stochastic scheduling on one or more machines," European Journal of Operational Research, Elsevier, vol. 80(2), pages 404-409, January.
- E. L. Lawler, 1973. "Optimal Sequencing of a Single Machine Subject to Precedence Constraints," Management Science, INFORMS, vol. 19(5), pages 544-546, January.
- Dileepan, P & Sen, T, 1988. "Bicriterion static scheduling research for a single machine," Omega, Elsevier, vol. 16(1), pages 53-59.
- Soroush, H. M., 1999. "Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 113(2), pages 450-468, March.
- Soroush, H. M. & Fredendall, L. D., 1994. "The stochastic single machine scheduling problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 77(2), pages 287-302, September.
- Thom J. Hodgson, 1977. "Note--A Note on Single Machine Sequencing with Random Processing Times," Management Science, INFORMS, vol. 23(10), pages 1144-1146, June.
- Sarin, Subhash C. & Erel, Erdal & Steiner, George, 1991. "Sequencing jobs on a single machine with a common due date and stochastic processing times," European Journal of Operational Research, Elsevier, vol. 51(2), pages 188-198, March.
- L. Escudero & M. Ortuño, 1997. "On due-date based valid cuts for the sequential ordering problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(1), pages 159-166, June.
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.- Soroush, H.M., 2007. "Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 181(1), pages 266-287, August.
- Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
- Baker, Kenneth R. & Trietsch, Dan, 2009. "Safe scheduling: Setting due dates in single-machine problems," European Journal of Operational Research, Elsevier, vol. 196(1), pages 69-77, July.
- Ali Salmasnia & Mostafa Khatami & Reza Kazemzadeh & Seyed Zegordi, 2015. "Bi-objective single machine scheduling problem with stochastic processing times," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(1), pages 275-297, April.
- Lemos, R.F. & Ronconi, D.P., 2015. "Heuristics for the stochastic single-machine problem with E/T costs," International Journal of Production Economics, Elsevier, vol. 168(C), pages 131-142.
- Jang, Wooseung, 2002. "Dynamic scheduling of stochastic jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 138(3), pages 518-530, May.
- X. Cai & S. Zhou, 1997. "Scheduling stochastic jobs with asymmetric earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(6), pages 531-557, September.
- Xiaoqiang Cai & Sean Zhou, 1999. "Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs," Operations Research, INFORMS, vol. 47(3), pages 422-437, June.
- Huo, Yumei & Leung, Joseph Y.-T. & Zhao, Hairong, 2007. "Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness," European Journal of Operational Research, Elsevier, vol. 177(1), pages 116-134, February.
- Laslo, Zohar & Golenko-Ginzburg, Dimitri & Keren, Baruch, 2008. "Optimal booking of machines in a virtual job-shop with stochastic processing times to minimize total machine rental and job tardiness costs," International Journal of Production Economics, Elsevier, vol. 111(2), pages 812-821, February.
- Soroush, H. M., 1999. "Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 113(2), pages 450-468, March.
- Ben-Daya, M. & Duffuaa, S. O. & Raouf, A., 1996. "Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine," European Journal of Operational Research, Elsevier, vol. 89(1), pages 100-107, February.
- Enrique Gerstl & Gur Mosheiov, 2020. "Single machine scheduling to maximize the number of on-time jobs with generalized due-dates," Journal of Scheduling, Springer, vol. 23(3), pages 289-299, June.
- Ramachandra, Girish & Elmaghraby, Salah E., 2006. "Sequencing precedence-related jobs on two machines to minimize the weighted completion time," International Journal of Production Economics, Elsevier, vol. 100(1), pages 44-58, March.
- Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
- Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
- Kolahan, F. & Liang, M., 1998. "An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 109(1), pages 142-159, August.
- P Chen & C-C Wu & W-C Lee, 2006. "A bi-criteria two-machine flowshop scheduling problem with a learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1113-1125, September.
- Huo, Yumei & Zhao, Hairong, 2015. "Total completion time minimization on multiple machines subject to machine availability and makespan constraints," European Journal of Operational Research, Elsevier, vol. 243(2), pages 547-554.
- Reha Uzsoy & Chung‐Yee Lee & Louis A. Martin‐Vega, 1992. "Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 369-388, April.
More about this item
Keywords
Stochastic scheduling Sequential ordering problem Makespan;Statistics
Access and download statisticsCorrections
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:eee:jomega:v:31:y:2003:i:3:p:169-187. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.