LIAAD

Permanent URI for this community

http://localhost:4000/handle/123456789/31
This service focuses its activity on decision support systems, with particular emphasis on data mining, forecasting, adaptive modeling and optimization techniques, with applications on marketing, finance, process scheduling, health, text information extraction, and many other areas

Browse

Browsing LIAAD by Author "5815"
  • Item
    Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed
    ( 2019) Jorge Valente ; Schaller,J ; 5815
    The two-machine permutation flow shop scheduling problem with the objective of minimizing total earliness and tardiness is addressed. Unforced idle time can be used to complete jobs closer to their due dates. It is shown that unforced idle time only needs to be considered on the second machine. This result is then used to extend a lower bound and dominance conditions for the single-machine problem to the two-machine permutation flow shop problem. Two branch-and-bound algorithms are developed for the problem utilizing the lower bound and dominance conditions. The algorithms are tested using instances that represent a wide variety of conditions.
  • Item
    Efficient heuristics for minimizing weighted sum of squared tardiness on identical parallel machines
    ( 2018) Jorge Valente ; Schaller,J ; 5815
    Scheduling jobs on a set of identical parallel machines using efficient heuristics when the objective is to minimize total weighted squared tardiness is considered. Two efficient heuristics and an improvement procedure are presented for the problem. These heuristics and other heuristics are tested using problem sets that represent a variety of conditions. The results show that one of the heuristics consistently performs better than the other heuristics tested. It is also shown how these heuristics can be incorporated into other procedures such as the existing Lagrangian relaxation procedure or meta-heuristics to obtain improved solutions for medium sized problems. © 2018 Elsevier Ltd
  • Item
    Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem
    ( 2020) Jorge Valente ; Costa,MRC ; Schaller,JE ; 5815
    This paper addresses a permutation flowshop scheduling problem, with the objective of minimizing total weighted squared tardiness. The focus is on providing efficient procedures that can quickly solve medium or even large instances. Within this context, we first present multiple dispatching heuristics. These include general rules suited to various due date-related environments, heuristics developed for the problem with a linear objective function, and procedures that are suitably adapted to take the squared objective into account. Then, we describe several improvement procedures, which use one or more of three techniques. These procedures are used to improve the solution obtained by the best dispatching rule. Computational results show that the quadratic rules greatly outperform the linear counterparts, and that one of the quadratic rules is the overall best performing dispatching heuristic. The computational tests also show that all procedures significantly improve upon the initial solution. The non-dominated procedures, when considering both solution quality and runtime, are identified. The best dispatching rule, and two of the non-dominated improvement procedures, are quite efficient, and can be applied to even very large-sized problems. The remaining non-dominated improvement method can provide somewhat higher quality solutions, but it may need excessive time for extremely large instances.
  • Item
    Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed
    ( 2019) Schaller,J ; Jorge Valente ; 5815
    This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimizing total earliness and tardiness. Unforced idle time is considered in order to reduce the earliness of jobs. It is shown how unforced idle time can be inserted on the final machine. Several dispatching heuristics that have been used for the problem without unforced idle time were modified and tested. Several procedures were also developed that conduct a second pass to develop a sequence using dispatching rules. These procedures were also tested and were found to result in better solutions.
  • Item
    Minimizing total earliness and tardiness in a nowait flow shop
    ( 2020) Jorge Valente ; Schaller,J ; 5815
    This paper considers the problem of scheduling jobs in a no-wait flow shop with the objective of minimizing total earliness and tardiness. An exact branch-and-bound algorithm is developed for the problem. Several dispatching heuristics used previously for other environments and two new heuristics were tested under a variety of conditions. It was found that one of the new heuristics consistently performed well compared to the others. An insertion search improvement procedure with speed up methods based on the structure of the problem was proposed and was found to deliver much improved solutions in a reasonable amount of time.