Skip to main content
SpringerLink
Log in

Ten notes on equal-processing-time scheduling

At the frontiers of solvability in polynomial time

  • Published:
Quarterly Journal of the Belgian, French and Italian Operations Research Societies Aims and scope Submit manuscript

Abstract.

Equal-processing-time scheduling problems whose complexity status has been unknown are shown to be solved in polynomial time by well-known and relatively new techniques. Single-machine, parallel-machine, parallel-batch, open-shop, flow-shop and job-shop environments are touched upon.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. UMR CNRS, HenDiaSyC, Université de Technologie, 60205, Compiégne CX, France

    Philippe Baptiste

  2. École Polytechnique, France

    Philippe Baptiste

  3. FB Mathematik/Informatik, Universität Osnabrück, 49069, Osnabrück, Germany

    Peter Brucker & Sigrid Knust

  4. CGI Group Inc., 1 Dundas St. W., Suite 2700, M5G 1Z3, Toronto, Ontario, Canada

    Vadim G. Timkovsky

  5. McMaster University, Canada

    Vadim G. Timkovsky

Authors
  1. Philippe Baptiste
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Brucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sigrid Knust
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Vadim G. Timkovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Philippe Baptiste.

Additional information

Received: February 2003, Revised: September 2003,

AMS classification:

90B35, 68Q25

All correspondence to: Vadim G. Timkovsky

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baptiste, P., Brucker, P., Knust, S. et al. Ten notes on equal-processing-time scheduling. 4OR 2, 111–127 (2004). https://doi.org/10.1007/s10288-003-0024-4

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-003-0024-4

Keywords:

Search

Navigation