A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Filters
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
The model generalizes the classical unrelated machine scheduling problem, adding a resource-time tradeoff. ...
We consider unrelated machine scheduling problems with the objective to minimize the schedule makespan. ...
Algorithm LP-Greedy is a (4 + 2 √ 2)-approximation algorithm for unrelated machine scheduling with resource-dependent processing times. ...
doi:10.1007/11496915_14
fatcat:wr63qhqa3zbpno3tsgolclv3ji
Machine scheduling with resource dependent processing times
2006
Mathematical 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 2019; you can also visit the original URL.
The file type is application/pdf.
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. ...
This model generalizes the classical unrelated parallel machine scheduling problem by adding a time-resource tradeoff. ...
We thank Hans Kellerer [15] for sharing with us several nice ideas, and we thank the anonymous referees for several helpful remarks. ...
doi:10.1007/s10107-006-0059-3
fatcat:hwkb7qa3frdqrlwd4jvv4rlo7a
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 ...
[35] deals with the hybrid flow shop scheduling problem with unrelated parallel machines and sequence-dependent setup times. In addition, the work of Naderi et al. ...
doi:10.1109/access.2019.2955975
fatcat:ubdj6stbwfgc5a7lnkk2orqq3u
A Statistical Comparison of Metaheuristics for Unrelated Parallel Machine Scheduling Problems with Setup Times
2022
Mathematics
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, 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. ...
Review about Scheduling Sequence-Dependent Setups in Unrelated Parallel Machines The scheduling problem occurring in unrelated parallel machines for processing sequence-dependent setup times is quite important ...
doi:10.3390/math10142431
fatcat:bitbh5xtnvb7xm4re4ha5ccuhe
An Ant Colony Optimization Algorithm for Scheduling Parallel Machines with Sequence--Dependent Setup Costs
2013
Zeszyty Naukowe
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.
The paper addresses the problem of scheduling preemptive jobs on parallel unrelated machines in the presence of renewable resource constraints and sequence-dependent setup costs. ...
The results of a computational experiment indicate that the heuristic is able to produce good results in reasonable computation time. ...
unrelated machines with sequence-dependent setup costs. ...
doi:10.26348/znwwsi.9.15
doaj:7f046d02420448ef8313ee52a6fcc570
fatcat:odsqemvuzrbhbk76adebadl6yi
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times
[chapter]
2006
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 2019; you can also visit the original URL.
The file type is application/pdf.
We consider a scheduling problem on unrelated parallel machines with the objective to minimize the makespan. ...
This model generalizes the classical unrelated parallel machine scheduling problem by adding a time-resource tradeoff. ...
Algorithm LP-Greedy is a 3.75-approximation algorithm for unrelated parallel machine scheduling with resource dependent processing times. ...
doi:10.1007/11830924_15
fatcat:cd4dbk6fmzb73jkfaajsgjv3vi
Bir Uygulama: Bir Beyaz Eşya Üretim Firmasının Boyahane Bölümünde Paralel Makineler için Sıraya Bağlı Kurulum Sürelerini içeren bir Model
2020
Osmaniye Korkut Ata Üniversitesi Fen Bilimleri Enstitüsü Dergisi
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.
A mixed-integer programming model with sequence-dependent setup times has been developed to solve the excessive work in process problems for the dye house station. ...
One of the ways of coping with the inventory problems in the mass production lines is to achieve and implement a detailed production schedule. ...
parallel machine
scheduling problem
Minimize the makespan and the flow
time
Gedik et al. [6]
Non-preemptive
unrelated
parallel
machine scheduling problem (PMSP) with
job sequence and machine-dependent ...
doi:10.47495/okufbed.779834
fatcat:77cefnjbzna3zpnrlvrtekiiyi
THE ABURAS HEURISTIC: A MODIFIED HEURISTIC FOR SCHEDULING UNRELATED PARALLEL MACHINE PROBLEMS
2012
South African Journal of 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 paper proposes the use of a new heuristic called ABURAS, which is designed to minimize the makespan of an unrelated parallel machine scheduling problem. ...
Scheduling is primarily considered with resource allocation; sequencing, however, is concerned with the order of jobs to be performed on the allocated resource (Sipper and Bulfin [8] ). ...
The parallel machine scheduling environment can be divided into three subenvironments, depending on whether the machines are identical, uniform, or unrelated. ...
doi:10.7166/18-1-137
fatcat:gw2wdacaababhmlw7mkcabbs3a
Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times
2011
The International Journal of Advanced Manufacturing Technology
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.
Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times. ...
We consider an unrelated parallel machine problem with machine and job sequence dependent setup times. ...
Among parallel machine scheduling problems, the most general case is when the parallel machines are said to be unrelated. ...
doi:10.1007/s00170-011-3318-2
fatcat:fsqbxj4svzbprnfdohjdgnueeq
Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem regarding Printed Circuit Boards
2022
Mathematics
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.
This problem involved machine eligibility restrictions, sequence-dependent setup times, precedence constraints, unequal job release times, and constraints of shared resources with the objectives of minimizing ...
An unrelated parallel machine scheduling problem motivated by the scheduling of a printed circuit board assembly (PCBA) under surface mount technology (SMT) is discussed in this paper. ...
Fanjul-Peyro [37] also studied an unrelated parallel machine scheduling problem with sequence-depend setups and shared resources. ...
doi:10.3390/math10132305
fatcat:b2c4zlo6jvdo3fizct7qjcworq
Some Common Machine Environment In Scheduling Problems
2014
Zenodo
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, we discussed extensively 10 different machine environments commonly encountered in scheduling problems. ...
We incorporated each of these environments into three parameter notation and four parameter notations of representation of scheduling problem. ...
Parallel machine environment can be classified into identical parallel machine, uniform parallel machine and unrelated parallel machine. ...
doi:10.5281/zenodo.1000024
fatcat:tunmjbvbkjflxc5vltxkryqgty
Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines
2014
The Scientific World Journal
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.
munrelated parallel machines scheduling problems with variable job processing times are considered, where the processing time of a job is a function of its position in a sequence, its starting time, and ...
The objective is to determine the optimal resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waiting) time, the total machine load, ...
Each job can be processed on any one of the unrelated parallel machines. Associated with each job ( = 1, 2, . . . , ) on machine , there is a normal processing time . ...
doi:10.1155/2014/242107
pmid:24982933
pmcid:PMC4058216
fatcat:44lrqgc3qzhbtnnmzpb7bi7wne
Flexible flow shop scheduling problem to minimize makespan with renewable resources
2019
Scientia Iranica. International Journal of Science and Technology
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 deals with a flexible flow shop (FFS) scheduling problem with unrelated parallel machines and renewable resource shared among the stages. ...
In such a system, to decrease the processing times, additional renewable resources are assigned to the jobs or machines, and it can lead to decrease the total completion time. ...
In the FFS scheduling problem with unrelated parallel machines, the processing time of the jobs in each stage is different and dependent on the type of machines. ...
doi:10.24200/sci.2019.53600.3325
fatcat:dbjixvbcavfjffmkfu2einfapi
GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources
2019
Expert systems with applications
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.
More specifically, we study the unrelated parallel machine scheduling problem with setup times and additional limited resources in the setups (UPMSR-S), with makespan minimization criterion. ...
This paper provides practitioners with new approaches for solving realistic scheduling problems that consider additional resources, which can be implemented on expert and intelligent systems and help decision ...
Afzalirad and Rezaeian (2016) propose an integer mathematical model and a genetic algorithm for an unrelated parallel machine scheduling problem with sequence dependent setup times, resource constraints ...
doi:10.1016/j.eswa.2019.112959
fatcat:4dkerirzojezphflnok4jjxnyu
Biobjective Scheduling for Joint Parallel Machines with Sequence-Dependent Setup by Taking Pareto-Based Approach
2021
Modelling and Simulation 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 2021; you can also visit the original URL.
The file type is application/pdf.
This paper therefore focuses on scheduling multiple unrelated parallel machines, via Pareto approach. With the proposed strategy, additional realistic concerns are addressed. ...
Provided a jobs list, each with a distinct resource work hour capacity, this novel scheduling is aimed at minimizing manufacturing costs, while maintaining the balance of machine utilization. ...
The problem
Conclusions In unrelated parallel machine (UPM) scheduling, the involved resources are prescribed with varying production conditions and constraints, e.g., processing and job sequence-dependent ...
doi:10.1155/2021/6663375
doaj:81dcbf990d2549eb9d111f0f8b98f35c
fatcat:zubnfuriuze5jmimdj2wrwizea
« Previous
Showing results 1 — 15 out of 15,125 results