Narrow search
Showing 1 - 10 of 98
Cover Image
Job-shop local-search move evaluation without direct consideration of the criterion’s value
Murovec, Boštjan - In: European Journal of Operational Research 241 (2015) 2, pp. 320-329
This article focuses on the evaluation of moves for the local search of the job-shop problem with the makespan … line of the argumentation also shows that by sacrificing accuracy the established makespan estimators unintentionally … improve on the move evaluation in comparison to the exact makespan calculation, in contrast to the belief that the reliance on …
Persistent link: https://www.econbiz.de/10011077629
Cover Image
Total completion time with makespan constraint in no-wait flowshops with setup times
Allahverdi, Ali; Aydilek, Harun - In: European Journal of Operational Research 238 (2014) 3, pp. 724-734
The m-machine no-wait flowshop scheduling problem with the objective of minimizing total completion time subject to the … constraint that the makespan value is not greater than a certain value is addressed in this paper. Setup times are considered non …
Persistent link: https://www.econbiz.de/10010785321
Cover Image
New hard benchmark for flowshop scheduling problems minimising makespan
Vallada, Eva; Ruiz, Rubén; Framinan, Jose M. - In: European Journal of Operational Research 240 (2015) 3, pp. 666-677
In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with the objective of … minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small instances with up to 800 …
Persistent link: https://www.econbiz.de/10010939781
Cover Image
On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost
Han, Bin; Zhang, Wenjun; Lu, Xiwen; Lin, Yingzi - In: European Journal of Operational Research 244 (2015) 3, pp. 704-714
This paper investigates minimization of both the makespan and delivery costs in on-line supply chain scheduling for … customer. The primary objective of the scheduling is time, which is makespan in this case. The delivery cost, which changes due … concerned. The goal of scheduling is thus to minimize both the makespan and the total delivery cost. This scheduling involves …
Persistent link: https://www.econbiz.de/10011264295
Cover Image
Heuristic solution methods for the stochastic flow shop problem
Baker, Kenneth R.; Altheimer, Dominik - In: European Journal of Operational Research 216 (2012) 1, pp. 172-177
We investigate the stochastic flow shop problem with m machines and general distributions for processing times. No analytic method exists for solving this problem, so we looked instead at heuristic methods. We devised three constructive procedures with modest computational requirements, each...
Persistent link: https://www.econbiz.de/10010871079
Cover Image
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
Lee, Kangbok; Leung, Joseph Y-T.; Jia, Zhao-hong; Li, Wenhua - In: European Journal of Operational Research 238 (2014) 1, pp. 54-64
We consider parallel machine scheduling problems where the processing of the jobs on the machines involves two types of … objectives. The first type is one of two classical objective functions in scheduling theory: either the total completion time or … the makespan. The second type involves an actual cost associated with the processing of a specific job on a given machine …
Persistent link: https://www.econbiz.de/10010871187
Cover Image
A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services
Ozturk, Onur; Begen, Mehmet A.; Zaric, Gregory S. - In: European Journal of Operational Research 239 (2014) 1, pp. 214-226
In this paper, we address the problem of parallel batching of jobs on identical machines to minimize makespan. The …
Persistent link: https://www.econbiz.de/10011097817
Cover Image
Total completion time minimization on multiple machines subject to machine availability and makespan constraints
Huo, Yumei; Zhao, Hairong - In: European Journal of Operational Research 243 (2015) 2, pp. 547-554
This paper studies preemptive bi-criteria scheduling on m parallel machines with machine unavailable intervals. The … goal is to minimize the total completion time subject to the constraint that the makespan is at most a constant T. We study …
Persistent link: https://www.econbiz.de/10011209321
Cover Image
Job-shop production scheduling with reverse flows
Abdeljaouad, Mohamed Amine; Bahroun, Zied; Omrane, Anissa; … - In: European Journal of Operational Research 244 (2015) 1, pp. 117-128
In this paper, we conduct a study of the job-shop scheduling problem with reverse flows. This NP-hard problem is … completion time of the jobs (i.e., the makespan). …
Persistent link: https://www.econbiz.de/10011209333
Cover Image
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne; Gupta, Jatinder N.D.; Herrmann, Jan - In: European Journal of Operational Research 243 (2015) 2, pp. 514-522
parallel machines where jobs can only be delivered at certain fixed delivery dates. Scheduling problems with fixed delivery …
Persistent link: https://www.econbiz.de/10011209377