IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v152y2004i1p159-169.html
   My bibliography  Save this article

The complexity of two-job shop problems with multi-purpose unrelated machines

Author

Listed:
  • Mati, Yazid
  • Xie, Xiaolan

Abstract

No abstract is available for this item.

Suggested Citation

  • Mati, Yazid & Xie, Xiaolan, 2004. "The complexity of two-job shop problems with multi-purpose unrelated machines," European Journal of Operational Research, Elsevier, vol. 152(1), pages 159-169, January.
  • Handle: RePEc:eee:ejores:v:152:y:2004:i:1:p:159-169
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00675-6
    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. Shakhlevich, Natalia V. & Sotskov, Yuri N. & Werner, Frank, 2000. "Complexity of mixed shop scheduling problems: A survey," European Journal of Operational Research, Elsevier, vol. 120(2), pages 343-351, January.
    2. Sotskov, Yu. N., 1991. "The complexity of shop-scheduling problems with two or three jobs," European Journal of Operational Research, Elsevier, vol. 53(3), pages 326-336, August.
    3. Brucker, Peter & Jurisch, Bernd, 1993. "A new lower bound for the job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 64(2), pages 156-167, January.
    4. Michael R. Garey & Robert E. Tarjan & Gordon T. Wilfong, 1988. "One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties," Mathematics of Operations Research, INFORMS, vol. 13(2), pages 330-348, May.
    5. William W. Hardgrave & George L. Nemhauser, 1963. "A Geometric Model and a Graphical Algorithm for a Sequencing Problem," Operations Research, INFORMS, vol. 11(6), pages 889-900, December.
    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. Chiang, Tsung-Che & Lin, Hsiao-Jou, 2013. "A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling," International Journal of Production Economics, Elsevier, vol. 141(1), pages 87-98.

    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. Peter Brucker & Yu Sotskov & Frank Werner, 2007. "Complexity of shop-scheduling problems with fixed number of jobs: a survey," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(3), pages 461-481, June.
    2. Agnetis, Alessandro & Kellerer, Hans & Nicosia, Gaia & Pacifici, Andrea, 2012. "Parallel dedicated machines scheduling with chain precedence constraints," European Journal of Operational Research, Elsevier, vol. 221(2), pages 296-305.
    3. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    4. Peter Damaschke, 2019. "Parameterized Mixed Graph Coloring," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 362-374, August.
    5. Yuri N. Sotskov, 2020. "Mixed Graph Colorings: A Historical Review," Mathematics, MDPI, vol. 8(3), pages 1-24, March.
    6. Y N Sotskov & A Allahverdi & T-C Lai, 2004. "Flowshop scheduling problem to minimize total completion time with random and bounded processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 277-286, March.
    7. Shakhlevich, Natalia V. & Sotskov, Yuri N. & Werner, Frank, 2000. "Complexity of mixed shop scheduling problems: A survey," European Journal of Operational Research, Elsevier, vol. 120(2), pages 343-351, January.
    8. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    9. Kate, H.A. ten & Wijngaard, J. & Zijm, W.H.M., 1995. "Minimizing weighted total earliness, total tardiness and setup costs," Research Report 95A37, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    10. Baptiste, Philippe & Sadykov, Ruslan, 2010. "Time-indexed formulations for scheduling chains on a single machine: An application to airborne radars," European Journal of Operational Research, Elsevier, vol. 203(2), pages 476-483, June.
    11. Ventura, Jose A. & Radhakrishnan, Sanjay, 2003. "Single machine scheduling with symmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 144(3), pages 598-612, February.
    12. Azeddine Cheref & Alessandro Agnetis & Christian Artigues & Jean-Charles Billaut, 2017. "Complexity results for an integrated single machine scheduling and outbound delivery problem with fixed sequence," Journal of Scheduling, Springer, vol. 20(6), pages 681-693, December.
    13. 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.
    14. Koulamas, Christos, 1996. "Single-machine scheduling with time windows and earliness/tardiness penalties," European Journal of Operational Research, Elsevier, vol. 91(1), pages 190-202, May.
    15. Kyung Sung Jung & Milind Dawande & H. Neil Geismar & V. Daniel R. Guide & Chelliah Sriskandarajah, 2016. "Supply planning models for a remanufacturer under just-in-time manufacturing environment with reverse logistics," Annals of Operations Research, Springer, vol. 240(2), pages 533-581, May.
    16. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    17. Joaquín Bautista & Ramon Companys & Albert Corominas, 1997. "Modelling and solving the production rate variation problem (PRVP)," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 5(2), pages 221-239, December.
    18. Mosheiov, Gur & Shadmon, Michal, 2001. "Minmax earliness-tardiness costs with unit processing time jobs," European Journal of Operational Research, Elsevier, vol. 130(3), pages 638-652, May.
    19. Sourd, Francis, 2005. "Punctuality and idleness in just-in-time scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 739-751, December.
    20. Hendel, Yann & Sourd, Francis, 2006. "Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem," European Journal of Operational Research, Elsevier, vol. 173(1), pages 108-119, August.

    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:ejores:v:152:y:2004:i:1:p:159-169. 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/eor .

    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.