Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0309-3
Abstract: We study the online scheduling problem on m identical parallel machines to minimize makespan, i.e., the maximum completion time of the jobs, where m is given in advance and the jobs arrive online over time.… read more here.
Keywords: parallel machines; chain precedence; online scheduling; precedence constraints ... See more keywords
Bicriteria scheduling of equal length jobs on uniform parallel machines
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-019-00507-w
Abstract: We study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling with generated completion times (shortly, GCT-scheduling), we show that the scheduling of equal… read more here.
Keywords: equal length; scheduling equal; parallel machines; bicriteria scheduling ... See more keywords
Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows
Sign Up to like & getrecommendations! Published in 2021 at "Arabian Journal for Science and Engineering"
DOI: 10.1007/s13369-021-06244-9
Abstract: In this paper, we address a variant of the identical parallel machines scheduling problem subject to common restrictive due windows. The performance measure adopted is the minimization of total weighted earliness and tardiness. Since the… read more here.
Keywords: subject common; restrictive due; parallel machines; due windows ... See more keywords
Rescheduling Production on Identical Parallel Machines upon new jobs arrivals
Sign Up to like & getrecommendations! Published in 2019 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2019.11.586
Abstract: Abstract This paper deals with a dynamic scheduling problem where a production schedule must be adapted to cope with the arrival of new orders. The problem encompasses several identical parallel machines with sequence-dependent setup times… read more here.
Keywords: new jobs; rescheduling production; production identical; parallel machines ... See more keywords
Bi-objective scheduling on uniform parallel machines considering electricity cost
Sign Up to like & getrecommendations! Published in 2018 at "Engineering Optimization"
DOI: 10.1080/0305215x.2017.1296437
Abstract: ABSTRACT This article investigates a bi-objective scheduling problem on uniform parallel machines considering electricity cost under time-dependent or time-of-use electricity tariffs, where electricity price changes with the hours within a day. The aim is to… read more here.
Keywords: uniform parallel; electricity; parallel machines; objective scheduling ... See more keywords
Construction of cyclic schedules in presence of parallel machines
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Applied and Industrial Mathematics"
DOI: 10.1134/s1990478917010033
Abstract: We consider the problem of processing some identical jobs with a complicated technological route on some production line in presence of parallel machines. Under some constrains on the number of jobs processed simultaneously, a cyclic… read more here.
Keywords: cyclic schedules; parallel machines; construction cyclic; presence parallel ... See more keywords
Metaheuristics for optimizing unrelated parallel machines scheduling with unreliable resources to minimize makespan
Sign Up to like & getrecommendations! Published in 2022 at "Advances in Mechanical Engineering"
DOI: 10.1177/16878132221097023
Abstract: Parallel machines scheduling problems with continuous availability of machines are NP-hardness (non-deterministic polynomial-time hardness) and have become very popular for the last decade; there is still very limited literature on this problem. The purpose of… read more here.
Keywords: problem; time; machines scheduling; proposed metaheuristics ... See more keywords
A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan
Sign Up to like & getrecommendations! Published in 2017 at "Advances in Mechanical Engineering"
DOI: 10.1177/1687814018756103
Abstract: We study an agent-based scheduling problem of two identical parallel machines: P 2 | Co | ∑ T A , C max B . The machines and tasks are regarded as agents. A new multi-agent… read more here.
Keywords: agent; time; two identical; multi agent ... See more keywords
Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times
Sign Up to like & getrecommendations! Published in 2018 at "PLoS ONE"
DOI: 10.1371/journal.pone.0200030
Abstract: This paper addresses the problem of makespan minimization on unrelated parallel machines with sequence dependent setup times. The symbiotic organisms search (SOS) algorithm is a new and popular global optimization technique that has received wide… read more here.
Keywords: machine; sos algorithm; parallel machines; unrelated parallel ... See more keywords