Browsing by Author "Michelon, Philippe Yves Paul"

Now showing 1 - 2 of 2
  • No Thumbnail Available
    Item
    Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties.
    (2016) Rosa, Bruno Ferreira; Souza, Marcone Jamilson Freitas; Souza, Sérgio Ricardo de; França Filho, Moacir Felizardo de; Ales, Zacharie; Michelon, Philippe Yves Paul
    This paper addresses the single machine scheduling problem with distinct time windows and sequence- dependent setup times. The objective is to minimize the total weighted earliness and tardiness. The prob- lem involves determining the job execution sequence and the starting time for each job in the sequence. An implicit enumeration algorithm denoted IE and a general variable neighborhood search algorithm de- noted GVNS are proposed to determine the job scheduling. IE is an exact algorithm, whereas GVNS is a heuristic algorithm. In order to define the starting times, an O ( n 2 ) idle time insertion algorithm (ITIA) is proposed. IE and GVNS use the ITIA algorithm to determine the starting time for each job. However, the IE algorithm is only valid for instances with sequence-independent setup times, and takes advantage of theoretical results generated for this problem. Computational experiments show that the ITIA algo- rithm is more efficient than the only other equivalent algorithm found in the literature. The IE algorithm allows the optimal solutions of all instances with up to 15 jobs to be determined within a feasible com- putational time. For larger instances, GVNS produces better-quality solutions requiring less computational time compared with the other algorithm from the literature.
  • No Thumbnail Available
    Item
    Scatter search based approach for the quadratic assignment problem
    (1997) Cung, Van Dat; Mautor, Thierry; Michelon, Philippe Yves Paul; Tavares, Andréa Iabrudi
    Scatter search is an evolutionary heuristic, proposed two decades ago, that uses linear combinations of a population subset to create new solutions. A special operator is used to ensure their feasibility and to improve their quality. In this paper, we propose a scatter search approach to the QAP problem. The basic method is extended with intensification and diversification stages and we present a procedure to generate good scattered initial solutions