3,045 research outputs found
Weighted tardiness minimization for unrelated machines with sequence-dependent and resource-constrained setups
Motivated by the need of quick job (re-)scheduling, we examine an elaborate
scheduling environment under the objective of total weighted tardiness
minimization. The examined problem variant moves well beyond existing
literature, as it considers unrelated machines, sequence-dependent and
machine-dependent setup times and a renewable resource constraint on the number
of simultaneous setups. For this variant, we provide a relaxed MILP to
calculate lower bounds, thus estimating a worst-case optimality gap. As a fast
exact approach appears not plausible for instances of practical importance, we
extend known (meta-)heuristics to deal with the problem at hand, coupling them
with a Constraint Programming (CP) component - vital to guarantee the
non-violation of the problem's constraints - which optimally allocates
resources with respect to tardiness minimization. The validity and versatility
of employing different (meta-)heuristics exploiting a relaxed MILP as a quality
measure is revealed by our extensive experimental study, which shows that the
methods deployed have complementary strengths depending on the instance
parameters. Since the problem description has been obtained from a textile
manufacturer where jobs of diverse size arrive continuously under tight
deadlines, we also discuss the practical impact of our approach in terms of
both tardiness decrease and broader managerial insights
High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First Search Heuristic
Many academic disciplines - including information systems, computer science, and operations management - face scheduling problems as important decision making tasks. Since many scheduling problems are NP-hard in the strong sense, there is a need for developing solution heuristics. For scheduling problems with setup times on unrelated parallel machines, there is limited research on solution methods and to the best of our knowledge, parallel computer architectures have not yet been taken advantage of. We address this gap by proposing and implementing a new solution heuristic and by testing different parallelization strategies. In our computational experiments, we show that our heuristic calculates near-optimal solutions even for large instances and that computing time can be reduced substantially by our parallelization approach
A statistical comparison of metaheuristics for unrelated parallel machine scheduling problems with setup times
Manufacturing scheduling aims to optimize one or more performance measures by allocating a set of resources to a set of jobs or tasks over a given period of time. It is an area that considers a very important decision-making process for manufacturing and production systems. In this paper, the unrelated parallel machine scheduling problem with machine-dependent and job-sequence-dependent setup times is addressed. This problem involves the scheduling of tasks on unrelated machines with setup times in order to minimize the makespan. The genetic algorithm is used to solve small and large instances of this problem when processing and setup times are balanced (Balanced problems), when processing times are dominant (Dominant P problems), and when setup times are dominant (Dominant S problems). For small instances, most of the values achieved the optimal makespan value, and, when compared to the metaheuristic ant colony optimization (ACOII) algorithm referred to in the literature, it was found that there were no significant differences between the two methods. However, in terms of large instances, there were significant differences between the optimal makespan obtained by the two methods, revealing overall better performance by the genetic algorithm for Dominant S and Dominant P problems.FCT—Fundação para a Ciência e Tecnologia through the R&D Units Project Scope UIDB/00319/2020 and EXPL/EME-SIS/1224/2021 and PhD grant UI/BD/150936/2021
A survey of scheduling problems with setup times or costs
Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
Non-Preemptive Scheduling on Machines with Setup Times
Consider the problem in which n jobs that are classified into k types are to
be scheduled on m identical machines without preemption. A machine requires a
proper setup taking s time units before processing jobs of a given type. The
objective is to minimize the makespan of the resulting schedule. We design and
analyze an approximation algorithm that runs in time polynomial in n, m and k
and computes a solution with an approximation factor that can be made
arbitrarily close to 3/2.Comment: A conference version of this paper has been accepted for publication
in the proceedings of the 14th Algorithms and Data Structures Symposium
(WADS
- …