IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v106y2007i2p574-584.html
   My bibliography  Save this article

Multiobjective single machine scheduling with nontraditional requirements

Author

Listed:
  • Haral, Uday
  • Chen, Rew-Win
  • Ferrell, William Jr
  • Kurz, Mary Beth

Abstract

No abstract is available for this item.

Suggested Citation

  • Haral, Uday & Chen, Rew-Win & Ferrell, William Jr & Kurz, Mary Beth, 2007. "Multiobjective single machine scheduling with nontraditional requirements," International Journal of Production Economics, Elsevier, vol. 106(2), pages 574-584, April.
    • Handle: RePEc:eee:proeco:v:106:y:2007:i:2:p:574-584
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(06)00212-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Hoogeveen, J. A. & van de Velde, S. L., 2001. "Scheduling with target start times," European Journal of Operational Research, Elsevier, vol. 129(1), pages 87-94, February.
    2. Koksalan Kondakci, Suna & Bekiroglu, Tuncay, 1997. "Scheduling with bicriteria: total flowtime and number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 53(1), pages 91-99, November.
    3. Della Croce, Federico, 1995. "Generalized pairwise interchanges and machine scheduling," European Journal of Operational Research, Elsevier, vol. 83(2), pages 310-319, June.
    4. Sarin, Subhash C. & Hariharan, R., 2000. "A two machine bicriteria scheduling problem," International Journal of Production Economics, Elsevier, vol. 65(2), pages 125-139, April.
    5. Fry, TD & Armstrong, RD & Lewis, H, 1989. "A framework for single machine multiple objective sequencing research," Omega, Elsevier, vol. 17(6), pages 595-607.
    6. Nagar, Amit & Haddock, Jorge & Heragu, Sunderesh, 1995. "Multiple and bicriteria scheduling: A literature survey," European Journal of Operational Research, Elsevier, vol. 81(1), pages 88-104, February.
    7. Pongcharoen, P. & Hicks, C. & Braiden, P. M. & Stewardson, D. J., 2002. "Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products," International Journal of Production Economics, Elsevier, vol. 78(3), pages 311-322, August.
    8. Dagli, C. H. & Sittisathanchai, S., 1995. "Genetic neuro-scheduler: A new approach for job shop scheduling," International Journal of Production Economics, Elsevier, vol. 41(1-3), pages 135-145, October.
    9. James C. Bean, 1994. "Genetic Algorithms and Random Keys for Sequencing and Optimization," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 154-160, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liao, Ching-Jong & Shyu, Cian-Ci & Tseng, Chao-Tang, 2009. "A least flexibility first heuristic to coordinate setups in a two- or three-stage supply chain," International Journal of Production Economics, Elsevier, vol. 117(1), pages 127-135, January.
    2. Erenay, Fatih Safa & Sabuncuoglu, Ihsan & Toptal, Aysegül & Tiwari, Manoj Kumar, 2010. "New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 201(1), pages 89-98, February.

    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. Erenay, Fatih Safa & Sabuncuoglu, Ihsan & Toptal, Aysegül & Tiwari, Manoj Kumar, 2010. "New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 201(1), pages 89-98, February.
    2. Vitayasak, Srisatja & Pongcharoen, Pupong & Hicks, Chris, 2017. "A tool for solving stochastic dynamic facility layout problems with stochastic demand using either a Genetic Algorithm or modified Backtracking Search Algorithm," International Journal of Production Economics, Elsevier, vol. 190(C), pages 146-157.
    3. Allesandro Agnetis & Pitu B. Mirchandani & Dario Pacciarelli & Andrea Pacifici, 2004. "Scheduling Problems with Two Competing Agents," Operations Research, INFORMS, vol. 52(2), pages 229-242, April.
    4. Arroyo, Jose Elias Claudio & Armentano, Vinicius Amaral, 2005. "Genetic local search for multi-objective flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 167(3), pages 717-738, December.
    5. T'kindt, Vincent & Monmarche, Nicolas & Tercinet, Fabrice & Laugt, Daniel, 2002. "An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 142(2), pages 250-257, October.
    6. Koksalan, Murat & Burak Keha, Ahmet, 2003. "Using genetic algorithms for single-machine bicriteria scheduling problems," European Journal of Operational Research, Elsevier, vol. 145(3), pages 543-556, March.
    7. T'kindt, V. & Billaut, J-C. & Proust, C., 2001. "Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry," European Journal of Operational Research, Elsevier, vol. 135(1), pages 42-49, November.
    8. M. Murat Köksalan, 1999. "A heuristic approach to bicriteria scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(7), pages 777-789, October.
    9. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    10. Alexandre Checoli Choueiri & Eduardo Alves Portela Santos, 2021. "Multi-product scheduling through process mining: bridging optimization and machine process intelligence," Journal of Intelligent Manufacturing, Springer, vol. 32(6), pages 1649-1667, August.
    11. Pongcharoen, P. & Promtet, W. & Yenradee, P. & Hicks, C., 2008. "Stochastic Optimisation Timetabling Tool for university course scheduling," International Journal of Production Economics, Elsevier, vol. 112(2), pages 903-918, April.
    12. Sivrikaya-Serifoglu, Funda & Ulusoy, Gunduz, 1998. "A bicriteria two-machine permutation flowshop problem," European Journal of Operational Research, Elsevier, vol. 107(2), pages 414-430, June.
    13. Subhash C. Sarin & Divya Prakash, 2004. "Equal Processing Time Bicriteria Scheduling on Parallel Machines," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 227-240, September.
    14. Paola Festa & Panos Pardalos, 2012. "Efficient solutions for the far from most string problem," Annals of Operations Research, Springer, vol. 196(1), pages 663-682, July.
    15. Ayşegül Altın & Bernard Fortz & Mikkel Thorup & Hakan Ümit, 2013. "Intra-domain traffic engineering with shortest path routing protocols," Annals of Operations Research, Springer, vol. 204(1), pages 65-95, April.
    16. Mosheiov, Gur, 2005. "Minimizing total completion time and total deviation of job completion times from a restrictive due-date," European Journal of Operational Research, Elsevier, vol. 165(1), pages 20-33, August.
    17. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    18. Ullrich, Christian A., 2013. "Integrated machine scheduling and vehicle routing with time windows," European Journal of Operational Research, Elsevier, vol. 227(1), pages 152-165.
    19. Philipp Rohlfshagen & John Bullinaria, 2010. "Nature inspired genetic algorithms for hard packing problems," Annals of Operations Research, Springer, vol. 179(1), pages 393-419, September.
    20. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.

    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:eee:proeco:v:106:y:2007:i:2:p:574-584. 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/locate/ijpe .

    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.