Skip to main content
SpringerLink
Log in

A new approach for scheduling independent tasks with multiple modes

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

Heuristic algorithms for scheduling tasks with multiple modes and minimizing the schedule length involve in general two distinct phases, task mode assignment and then task scheduling. We propose a novel approach where these two features are managed in an integrated mechanism with mode assignment embedded in scheduling. The problem is first reformulated as a special single-mode task scheduling problem, and then is modeled as a graph interval T-coloring. Finally, a tabu-like metaheuristic is proposed for this latter graph coloring problem, and the performance of our approach is compared to known multi-mode scheduling heuristics.

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

References

  • Bianco, L., Dell’Olmo, P., Speranza, M.G.: Scheduling independent tasks with multiple modes. Discrete Appl. Math. 62, 35–50 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  • Bianco, L., Dell’Olmo, P., Speranza, M.G.: Heuristics for multi-mode scheduling problems with dedicated resources. Eur. J. Oper. Res. 107, 260–271 (1998)

    Article  MATH  Google Scholar 

  • Bianco, L., Dell’Olmo, P., Giordani, S., Speranza, M.G.: Minimizing makespan in a multimode multiprocessor shop scheduling problem. Naval Res. Logist. 46, 893–911 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Błażewicz, J., Ecker, K., Pesch, E., Schmidt, G., Węglarz, J.: Scheduling Computers and Manufacturing Processes, 2nd edn. Springer, Berlin (2001)

    Google Scholar 

  • Chang, G.J., Liu, D.D.-F., Zhu, X.: Distance graphs and T-coloring. J. Comb. Theory Ser. B 75, 259–269 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  • Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic, New York (1980)

    MATH  Google Scholar 

  • González-Velarde, J.L., Laguna, M.: Tabu search with simple ejection chains for coloring graphs. Ann. Oper. Res. 117, 165–174 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  • Glover, F.: Multi-start and strategic oscillation methods—principles to exploit adaptive memory. In: Laguna, M., Gozales Velarde, J.L. (eds.) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 1–24. Kluwer Academic, Amsterdam (2000)

    Google Scholar 

  • Kubiak, W., Błażewicz, J., Formanowicz, P., Breit, J.: Two-machine flow shops with limited machine availability. Eur. J. Oper. Res. 136, 528–540 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria dell’Impresa, University of Rome “Tor Vergata”, Via del Politecnico, 1, 00133, Rome, Italy

    Massimiliano Caramia & Stefano Giordani

Authors
  1. Massimiliano Caramia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Giordani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Massimiliano Caramia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Caramia, M., Giordani, S. A new approach for scheduling independent tasks with multiple modes. J Heuristics 15, 313–329 (2009). https://doi.org/10.1007/s10732-007-9062-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-007-9062-y

Keywords

Search

Navigation