skip to main content
10.1145/1389095.1389412acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

On the partitioning of dynamic scheduling problems -: assigning technicians to areas

Published: 12 July 2008 Publication History

Abstract

BT workforce scheduling problem considers technicians (with different skills) which are assigned to tasks which arrive (partially) dynamically during the day. In order to manage their workforce, BT divides the different regions into several areas. In the beginning of each day all the technicians in a region are assigned to one of these areas. During the day, tasks can only be allocated to technicians from the same area. In this paper we use a (1+1) EA in order to decide, once the area have been defined, which technicians to assign to which areas.

Cited By

View all
  • (2010)A guided local search based algorithm for the multiobjective empowerment-based field workforce scheduling2010 UK Workshop on Computational Intelligence (UKCI)10.1109/UKCI.2010.5625597(1-6)Online publication date: Sep-2010
  • (2010)On the partitioning of dynamic workforce scheduling problemsJournal of Scheduling10.1007/s10951-009-0152-613:4(411-425)Online publication date: 1-Aug-2010

Index Terms

  1. On the partitioning of dynamic scheduling problems -: assigning technicians to areas

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation
    July 2008
    1814 pages
    ISBN:9781605581309
    DOI:10.1145/1389095
    • Conference Chair:
    • Conor Ryan,
    • Editor:
    • Maarten Keijzer
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 July 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. multiobjective optimization
    2. noisy fitness functions

    Qualifiers

    • Poster

    Conference

    GECCO08
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2010)A guided local search based algorithm for the multiobjective empowerment-based field workforce scheduling2010 UK Workshop on Computational Intelligence (UKCI)10.1109/UKCI.2010.5625597(1-6)Online publication date: Sep-2010
    • (2010)On the partitioning of dynamic workforce scheduling problemsJournal of Scheduling10.1007/s10951-009-0152-613:4(411-425)Online publication date: 1-Aug-2010

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media