2,555 Hits in 5.0 sec

A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups

Hochang Lee, Monique Guignard
1996 Journal of the Operational Research Society  
Key words: scheduling, Lagrangean decomposition, Lagrangean relaxation INTRODUCTION We deal with the problem of allocating workload on parallel unrelated machines with setups (PUMS) in a batch mode.  ...  Dietrich*® proposed a two-phase heuristic for the nonpreemptive scheduling problem on parallel unrelated machines with setups. Dietrich and Escudero?  ... 
doi:10.2307/3010037 fatcat:6qpvgokzlbcqffl5x3mzin27ca

Page 9414 of Mathematical Reviews Vol. , Issue 2001M [page]

2001 Mathematical Reviews  
Summary: “This paper considers a scheduling problem where each of n jobs has to be processed without interruption on exactly one of m unrelated parallel machines.  ...  [Werner, Frank] (D-MAG; Magdeburg) Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties.  ... 

Minimizing the Number of Tardy Jobs on Identical Parallel Machines Subject to Periodic Maintenance

Almasarwah Najat, Chen Yuan, Suer Gursel, Yuan Tao
2019 Procedia Manufacturing  
This paper considers the problem of scheduling n independent jobs on m identical parallel machines in order to minimize the number of tardy jobs (   ) considering the periodic preventive maintenance  ...  It depends on scheduling jobs with several batches based on the working time interval, where the total processing time of jobs for each batch should not exceed the working time interval.  ...  Generally, parallel machines can be classified as identical, unrelated, or uniform machines based on the processing times of jobs on each machine.  ... 
doi:10.1016/j.promfg.2020.01.147 fatcat:ut3wnfjhgjgcrg2ga433lgaxla

Warehouse scheduling performance analysis considering LHRL

Wen-Qiang Yang, Li Deng, Qun Niu, Min-Rui Fei
2013 Advances in Manufacturing  
In this paper, we consider the parallel-batch scheduling problems on unrelated parallel machines.  ...  For the bounded parallel-batch model, we discuss the case with pij = pi for i = 1, · · · , m and j = 1, · · · , n, give an optimal algorithm for the general schedule to minimize the total weighted completion  ...  [14−15] considered the bounded and unbounded parallel-batch scheduling problem with rejection on a single machine.  ... 
doi:10.1007/s40436-013-0015-4 fatcat:vbik2zmqyveormd5765rwd7qye

Efficient algorithms to minimize Makespan of the unrelated parallel Batch-processing machines scheduling problem with unequal job ready times

yaser zarouk, javad rezaeian, iraj mahdavi, Masoud Yaghini
2021 Reserche operationelle  
This paper considers the minimization of makespan in the unrelated parallel batch processing machines scheduling problem with considering non-identical job size and dynamic job ready time.  ...  The considered unrelated machines have different capacity and different processing speed.  ...  [10] considered the unrelated parallel batch processing machine scheduling problem with different speed and capacity of the machines and unequal job ready time.  ... 
doi:10.1051/ro/2021062 fatcat:6nthprsqbjevhfp2wqyqrndzgy

Page 2007 of The Journal of the Operational Research Society Vol. 60, Issue Supplement 1 [page]

2009 The Journal of the Operational Research Society  
Complexity of machine scheduling problems. Ann Disc Math 1: 343-362 Lenstra JK, Shmoys DB and Tardos E (1990). Approximation algorithms for scheduling unrelated parallel machines.  ...  Scheduling jobs and maintenance activities on parallel machines. Nav Res Logist 47: 145-165. Lee C-Y and Chen Z-L (2001). Machine scheduling with transportation considerations.  ... 

Tabu Search Algorithm Based on Lower Bound and Exact Algorithm Solutions for Minimizing the Makespan in Non-Identical Parallel Machines Scheduling

Mohammed A. Noman, Moath Alatefi, Abdulrahman M. Al-Ahmari, Tamer Ali, Jiafu Su
2021 Mathematical Problems in Engineering  
of jobs on unrelated parallel machines.  ...  parallel machines.  ...  the makespan in unrelated parallel batch-processing machines for scheduling nonidentical job sizes and unequal ready times.  ... 
doi:10.1155/2021/1856734 fatcat:ue3bsaqmhja4pdwyfgklfwm2va

Lot Sizing and Scheduling in Parallel Uniform Machines – A Case Study [chapter]

F. Charrua, Francisco Brojo, Pedro M.
2012 Simulated Annealing - Advances, Applications and Hybridizations  
Mokotoff (2001) published a review article on production scheduling in parallel machines.  ...  The following levels of complexity can be considered: i) identical parallel machines; ii) uniform parallel machines and iii) unrelated parallel machines.  ...  Scenario Machine Group  ... 
doi:10.5772/50975 fatcat:bkgrmblprfba3cujbersntpqfa

A Metaheuristic approach for Batch Sizing and Scheduling Problem in Flexible Flow Shop with Unrelated Parallel Machines

Ebrahim AsadiGangraj, Nasim Nahavandi
2014 International Journal of Computer Applications  
This article considers a makespan minimization batch sizing and scheduling problem in a flexible flow shop scheduling problem with unrelated parallel machines and sequence dependent setup time.  ...  Keywords Batch sizing, flexible flow shop, metaheuristic method, scheduling.  ...  [13] focused on bi-objective scheduling problem for FFS problems with unrelated parallel machines and setup times.  ... 
doi:10.5120/17013-7292 fatcat:cbspk6m4crevddrzuidoj7budy

A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times

Djamel Nait Tahar, Farouk Yalaoui, Chengbin Chu, Lionel Amodeo
2006 International Journal of Production Economics  
In this study, we consider the problem of scheduling a set of independent jobs with sequence-dependent setup times and job splitting, on a set of identical parallel machines such that maximum completion  ...  The performance of our new method is tested on over 6000 instances with different size by comparing it with a lower bound. r  ...  The first on parallel machines scheduling problem dates from the Fifties through the works of McNaughton (1959) and Hu (1961) .  ... 
doi:10.1016/j.ijpe.2004.12.007 fatcat:xlgmlivrsralnbi7cl2qjt473a

Page 3484 of Mathematical Reviews Vol. , Issue 2001E [page]

2001 Mathematical Reviews  
Summary: “In this paper we deal with the problem of assigning a set of n jobs, with release dates and tails, to either one of two unrelated parallel machines and scheduling each machine so that the makespan  ...  {For the entire collection see MR 2001d:90008. } 2001e:90026 90B35 90C57 Lancia, Giuseppe (I-PADV-EI; Padua) Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize  ... 

Batch Scheduling In A Two-Stage Flexible Flow Shop Problem

Enrique Gerstl, Gur Mosheiov, Assaf Sarig
2014 Foundations of Computing and Decision Sciences  
A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule.  ...  We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage.  ...  They focused on the option of Not-All-Machines (NAM) on parallel-unrelated machines. Previously, Cao et al.  ... 
doi:10.2478/fcds-2014-0001 fatcat:kevgvc6hnbfcjepeushr4o77je

High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First Search Heuristic [article]

Gerhard Rauchecker, Guido Schryen
2016 arXiv   pre-print
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  ...  Since many scheduling problems are NP-hard in the strong sense, there is a need for developing solution heuristics.  ...  Heuristics Regarding parallel machine scheduling on unrelated machines with non-batch sequence-dependent setup times, there are only a few publications that develop solution heuristics (Lin and Ying 2014  ... 
arXiv:1605.04682v1 fatcat:pvzpcgq5yzhkhdo5ogti2d4z4m

A multi objective volleyball premier league algorithm for green scheduling identical parallel machines with splitting jobs

Khodakaram Salimifard, Jingpeng Li, Davood Mohammadi, Reza Moghdani
2020 Applied intelligence (Boston)  
This paper proposes a mathematical model for scheduling parallel machines with splitting jobs and resource constraints.  ...  AbstractParallel machine scheduling is one of the most common studied problems in recent years, however, this classic optimization problem has to achieve two conflicting objectives, i.e. minimizing the  ...  [60] addressed the unrelated parallel batch processing machine problems. In this study, jobs are not identical and each machine is able to process several jobs as a batch.  ... 
doi:10.1007/s10489-020-02027-1 fatcat:5ptss32qkbetzich5j6cw7gu4m

A review of scheduling problem and resolution methods in flexible flow shop

Tian-Soon Lee, Ying-Tai Loong
2019 International Journal of Industrial Engineering Computations  
The Flexible flow shop (FFS) is defined as a multi-stage flow shops with multiple parallel machines.  ...  This paper gives a comprehensive guide for the reader with respect to future research work on the FFS scheduling problem.  ...  machines parallel machines problem with an alternative tight speed-dependent bound for the S-E heuristic.  ... 
doi:10.5267/j.ijiec.2018.4.001 fatcat:kiq2jjjsmzgtpoaudrq4qc7ndi
« Previous Showing results 1 — 15 out of 2,555 results