Results 91 to 100 of about 4,494 (215)
Proportionally Fair Makespan Approximation
Proceedings of the AAAI Conference on Artificial IntelligenceWe study fair mechanisms for the classic job scheduling problem on unrelated machines with the objective of minimizing the makespan. This problem is equivalent to minimizing the egalitarian social cost in the fair division of chores. The two prevalent fairness notions in the fair division literature are envy-freeness and proportionality. Prior work has
Feldman, Michal +3 more
openaire +2 more sources
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective [PDF]
, 2004 José M. Framiñán +2 more
openalex +1 more source
The trade-off between stability and makespan in resource-constrained project scheduling [PDF]
, 2005 Stijn Van de Vonder +3 more
openalex +1 more source
Jurnal Teknik Industri, 2001 This research gives an alternative to build production schedule using Evolutionary Algorithm. The objective function is minimizing production makespan. Shortest Processing Time (SPT) and Longest Processing Time (LPT) methods are used as initial solution.
Lala Febriana, I Gede Agus Widyadana
doaj
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan [PDF]
, 2006 Min Ji, T.C.E. Cheng
openalex +1 more source
Universality of Makespan in Flowshop Scheduling Problem
, 2016 40 pages, 19 ...
Shinzato, Takashi +2 more
openaire +2 more sources
TABU SEARCH SEBAGAI LOCAL SEARCH PADA ALGORITMA ANT COLONY UNTUK PENJADWALAN FLOWSHOP
Jurnal Teknik Industri, 2009 Ant colony optimization (ACO) is one of the meta-heuristic methods developed for finding solutions to optimization problems such as scheduling. Local search method is one part of the ACO which determines the quality of the resulting solution.
Iwan Halim Sahputra +2 more
doaj
Dynamic resource management heuristics for minimizing makespan while maintaining an acceptable level of robustness in an uncertain environment [PDF]
, 2006 Ashish Mehta +5 more
openalex +1 more source
Spektrum Industri: Jurnal Ilmiah Pengetahuan dan Penerapan Teknik Industri, 2018 Penelitian ini membahas tentang penjadwalan flow shop n job m mesin dengan pendekatan metode First Come First Served (FCFS), Earliest Due Date (EDD) dan Algoritma Heuristik Pour.
Dwi Agustina Kurniawati +1 more
doaj
Jurnal Teknik Industri, 2004 This paper presents a study about new heuristic algorithm performance compared to Mixed Integer Programming (MIP) method in solving flowshop scheduling problem to reach minimum makespan.
Tessa Vanina Soetanto +2 more
doaj