Two meta-heuristic algorithms for scheduling on unrelated machines with the late work criterion
Authors:
Open Access
- 1 January 2020
- journal article
- research article
- Published by University of Zielona Góra, Poland in International Journal of Applied Mathematics and Computer Science
- Vol. 30 (3) , 573-584
Abstract
A scheduling problem in considered on unrelated machines with the goal of total late work minimization, in which the late work of a job means the late units...Keywords
This publication has 33 references indexed in Scilit:
- Mirror scheduling problems with early work and late work criteriaJournal of Scheduling, 2020
- Single‐machine scheduling with deadlines to minimize the total weighted late workNaval Research Logistics (NRL), 2019
- Scheduling on parallel identical machines with late work criterion: Offline and online casesJournal of Scheduling, 2015
- Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problemSoft Computing, 2015
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delaysApplied Mathematical Modelling, 2014
- A note on the two machine job shop with the weighted late work criterionJournal of Scheduling, 2007
- Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due DateLecture Notes in Computer Science, 2005
- A genetic algorithm tutorialStatistics and Computing, 1994
- Approximation algorithms for scheduling a single machine to minimize total late workOperations Research Letters, 1992
- Minimizing mean weighted execution time loss on identical and uniform processorsInformation Processing Letters, 1987