A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
[chapter]
Approximation and Online Algorithms
Preserved Fulltext
[4] gave a performance guarantee of 3/2−1/2m for move-optimal schedules. Over the last years, very large-scale neighborhoods has received considerable attention. ...
[2] and Deȋneko and Woeginger [5] present an overview of very large-scale neighborhoods for the traveling salesman and quadratic assignment problem. ...
doi:10.1007/978-3-540-77918-6_4
dblp:conf/waoa/BruggemannHVW07
fatcat:7shlwbtjlreofme2muelqxptwu
Optimize Unrelated Parallel Machines Scheduling Problems With Multiple Limited Additional Resources, Sequence-Dependent Setup Times and Release Date Constraints
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
INDEX TERMS Scheduling, parallel machines, renewable resources, variable neighborhood search. ...
This paper considers the problem of scheduling a set of jobs on unrelated parallel machines subject to several constraints which are non-zero arbitrary release dates, limited additional resources, and ...
TABLE 8 . 8 Comparisons TVNS-SA (IV) with VNS (IV) for large-scaled instances. VOLUME 7, 2019
TABLE 9 . 9 Paired t tests with 95% confidence on the makespan for all problem instances. 171544 ...
doi:10.1109/access.2019.2955975
fatcat:ubdj6stbwfgc5a7lnkk2orqq3u
Tabu Search Algorithm Based on Lower Bound and Exact Algorithm Solutions for Minimizing the Makespan in Non-Identical Parallel Machines Scheduling
2021
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, a developed TS algorithm based on lower bound (LB) and exact algorithm (EA) solutions is proposed with the objective of minimizing the total completion time (makespan) of jobs on nonidentical ...
interested in the scheduling of jobs on unrelated parallel machines. ...
[14] developed a variable neighborhood descent search algorithm hybridized with mathematical programming elements for minimizing the makespan for scheduling jobs on unrelated parallel machines. e study ...
doi:10.1155/2021/1856734
fatcat:ue3bsaqmhja4pdwyfgklfwm2va
Robust Parallel Machine Scheduling Problem with Uncertainties and Sequence-Dependent Setup Time
2016
Scientific Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Moreover, a modified artificial bee colony algorithm is developed to solve large-scale problems. ...
In addition, each job must be processed together with a mold while jobs which belong to one family can share the same mold. ...
A makespan minimization problem with interval job processing time on identical parallel machines is addressed in [5] for the first time in related field. ...
doi:10.1155/2016/5127253
fatcat:kajpwaf5uzcehmnzismfwcz5g4
A Survey of Solving Approaches for Multiple Objective Flexible Job Shop Scheduling Problems
2015
Cybernetics and Information Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Usually hybrid metaheuristic algorithms are proposed for large dimensional real life problems and they outlay the tendency for the future developments of efficient solution approaches for multiple objective ...
These techniques could be classified into two groups: approaches with application of mathematical models and heuristic approaches. ...
the purposes of development of software tool for generating efficient schedules by an innovative method for multiple objective optimization in discrete manufacturing within the scope of small and medium ...
doi:10.1515/cait-2015-0025
fatcat:aqgxekvzpbd4rf6uoyta655xi4
Flexible Job Shop Scheduling Using a Multiobjective Memetic Algorithm
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper addresses the flexible job shop scheduling problem with minimization of the makespan, maximum machine workload, and total machine workload as the objectives. ...
The proposed algorithm is compared with three benchmark algorithms using fifteen classic problem instances. Its performance is better in terms of the number and quality of the obtained solutions. ...
One crossover and one mutator were proposed for sequencing, and one crossover and two mutators were for routing. Yazdani et al. [9] proposed a parallel variable neighborhood search (VNS) algorithm. ...
doi:10.1007/978-3-642-25944-9_7
fatcat:scmwcnmgenaufkkrd4odg5plp4
Study on multi-objective optimization for parallel batch machine scheduling using variable neighbourhood search
2013
2013 Winter Simulations Conference (WSC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
This paper presents computational results for solving Parallel Batch Machine Problems (PBMSP) with Variable Neighborhood Search (VNS), enriched with experiences from industry. ...
Especially PMSPs with batching are at the focus of researchers and experts from industry, in the further course of the work mentioned as Parallel Batch Machine Scheduling Problems (PBMSPs). ...
Special thanks go to Jens Doleschal and Manfred Benesch from Dresden University of Sciences who maintain server and systems essential for our experiments with all their expertise and commitment. ...
doi:10.1109/wsc.2013.6721726
dblp:conf/wsc/KohnRL13
fatcat:6ru7oaxpfvbklbulaqf542ctpq
Parallel-machine Scheduling with Precedence Constraints and Controllable Job-processing Times
2017
Proceedings of the 6th International Conference on Operations Research and Enterprise Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A parallel-machine scheduling problem with tree-formed precedence constraints is studied, where jobprocessing times can be compressed by allocating extra resource to the jobs. ...
Experiment shows the algorithm is capable for providing satisfactory schedules for media and large-sized problems within acceptable computing time. ...
Parallel-machine Scheduling with Precedence Constraints and Controllable Job-processing Times ...
doi:10.5220/0006290804700476
dblp:conf/icores/XuFZ17
fatcat:pige2fgif5ey7p6wg35nik3wvq
Robust Optimization on Unrelated Parallel Machine Scheduling with Setup Times
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper addresses the robust makespan optimization problem on unrelated parallel machine scheduling with sequence-dependent setup times, where the processing times are uncertain, and the only knowledge ...
The parallel machine scheduling problem has been a popular topic for many years due to its theoretical and practical importance. ...
We propose a robust (min-max regret) makespan minimization problem on unrelated parallel machines with setup times, and the uncertain processing times lie in intervals and no other information on the distribution ...
arXiv:2010.11839v1
fatcat:xrsuq7f3knandov46jieolvla4
Lagrangian approach to minimize makespan of non-identical parallel batch processing machines
2016
Computers & industrial engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This research focuses on minimizing the makespan of a set of non-identical parallel batch processing machines. In order to schedule jobs on these machines, two decisions are to be made. ...
The second decision is to sequence the batches formed on the machines such that the makespan is minimized. ...
Mokotoff [21] shows that minimizing makespan for identical parallel BPM can be done with a new approximation algorithm based on Linear Programming (LP). ...
doi:10.1016/j.cie.2016.09.018
fatcat:pzz5j3zxozasvp2bracq77g4kq
Two meta-heuristic algorithms for optimizing a multi-objective supply chain scheduling problem in an identical parallel machines environment
2021
International Journal of Industrial Engineering Computations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The experiments on MOPSO and NSGA-II are carried out on small, medium, and large scale problems. Moreover, the performance of the two algorithms is compared according to some comparing criteria. ...
In this article, a bi-objective integrated scheduling problem of production and distribution is addressed in a production environment with identical parallel machines. ...
Saeidi (2016) solved a multi-objective scheduling problem on parallel machines with the intention to minimize both the makespan and machine costs by using MOPSO and NSGA-II. ...
doi:10.5267/j.ijiec.2021.3.002
doaj:26fc549ddd68451da199acab2b39cb78
fatcat:c7mopklbgzgb7lnmwqfmimezh4
Hybrid Genetic Algorithm with Multiparents Crossover for Job Shop Scheduling Problems
2015
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The job shop scheduling problem (JSSP) is one of the well-known hard combinatorial scheduling problems. This paper proposes a hybrid genetic algorithm with multiparents crossover for JSSP. ...
Once a schedule is obtained, a neighborhood search is applied to exploit the search space for better solutions and to enhance the GA. ...
But, for the moderate and large scale instances, they require very high computational time to be either ineffective or inefficient [2] . ...
doi:10.1155/2015/210680
fatcat:xel7hbjzi5fgzi76uquxhiww4u
Efficient Job Scheduling in Grid Computing with Modified Artificial Fish Swarm Algorithm
2009
Journal of clean energy technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The basic idea of AFSA is to imitate the fish behaviors such as preying, swarming, and following with local search of fish individual for reaching the global optimum. ...
one of the open issues in grid computing is efficient job scheduling. ...
We tested the GA, SA and MAFSA for large scale job scheduling. Table. 3 shows the results. We can see that the performance of MAFSA is better than GA and SA under the same condition. ...
doi:10.7763/ijcte.2009.v1.3
fatcat:sdlnc7xx4vcsrb6aupgk4zgr7m
A two-stage solution approach for plastic injection machines scheduling problem
2017
Journal of Industrial and Management Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this study, a multi-objective mathematical model is proposed for parallel machine scheduling problem to minimize makespan, total tardiness, and total waiting time. ...
To solve large-scale problems in a short time, a two-stage solution approach is also proposed. ...
Liu and Wu [19] developed a genetic algorithm for minimizing the number of tardy jobs in an identical parallel machine scheduling problem, and they achieved successful results for large-scale problems ...
doi:10.3934/jimo.2020022
fatcat:a3faqiacgnd7lc4sbmht3c3qiy
Improved Beam Search for Optimizing No-wait Flowshops with Release Times
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
For this purpose, an original mixed-integer linear programming (MILP) formulation is proposed for minimizing makespan. ...
The statistical analysis confirmed that the improved BS algorithm performs better in terms of solution quality. ...
FIGURE 8 . 8 Visual representation of BS and BS LS performance for solving TA very-large-scale instances.
TABLE 1 .TABLE 2 . 12 Illustrative example. ...
doi:10.1109/access.2020.3015737
fatcat:ux2vyvduzbhttlcqsslaqybl4u
« Previous
Showing results 1 — 15 out of 431 results