Similar Search Results

Minimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times

Noori-Darvish, Samaneh; Tavakkoli-Moghaddam, Reza - In: Journal of industrial engineering international 8 (2012), pp. 1-13

machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan …

Persistent link: https://www.econbiz.de/10009758826

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

Kia, Hamidreza; Ghodsypour, Seyed Hassan; Davoudpour, Hamid - In: Journal of industrial engineering international 13 (2017) 3, pp. 297-306

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they...

Persistent link: https://www.econbiz.de/10011765286

Improved teaching-learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Buddala, Raviteja; Mahapatra, Siba Sankar - In: Journal of industrial engineering international 14 (2018) 3, pp. 555-570

of meta-heuristics have been proposed in the past. However, tuning algorithm-specific parameters for solving FFSP is … are chosen for the study because these are not only recent meta-heuristics but they do not require tuning of algorithm … calculate makespan and computational time. It is found that the rate of convergence of TLBO is superior to JAYA. From the …

Persistent link: https://www.econbiz.de/10011887964

An integrated approach for scheduling flexible job-shop using teaching-learning-based optimization method

Buddala, Raviteja; Mahapatra, Siba Sankar - In: Journal of industrial engineering international 15 (2019) 1, pp. 181-192

(FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job … to other meta-heuristics. Therefore, it can be considered as an efficient algorithm. As best student of the class is … loss in diversity in the population. So, like many meta-heuristics, TLBO also has a tendency to get trapped at the local …

Persistent link: https://www.econbiz.de/10012020105

MILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags

Hamdi, Imen; Toumi, Saïd - In: Journal of industrial engineering international 15 (2019), pp. 223-229

In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We...

Persistent link: https://www.econbiz.de/10012164656

A three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times

Maleki-Darounkolaei, Aref; Modiri, Mahmoud; … - In: Journal of industrial engineering international 8 (2012), pp. 1-7

first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are …

Persistent link: https://www.econbiz.de/10009758825

An electromagnetism-like metaheuristic for open-shop problems with no buffer

Naderi, Bahman; Najafi, Esmaeil; Yazdani, Mehdi - In: Journal of industrial engineering international 8 (2012), pp. 1-8

This paper considers open-shop scheduling with no intermediate buffer to minimize total tardiness. This problem occurs in many production settings, in the plastic molding, chemical, and food processing industries. The paper mathematically formulates the problem by a mixed integer linear program....

Persistent link: https://www.econbiz.de/10009759539

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Thomas, Jaya; Chaudhari, Narendra S. - In: Journal of industrial engineering international 10 (2014), pp. 1-16

Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex...

Persistent link: https://www.econbiz.de/10011556427

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

Mirabi, Mohammad; Fatemi Ghomi, S. M. T.; Jolai, F. - In: Journal of industrial engineering international 10 (2014), pp. 1-9

developed heuristics and computational experimental results show that the proposed HGA performs very competitively with respect …

Persistent link: https://www.econbiz.de/10011556480

Maximizing the nurses' preferences in nurse scheduling problem : mathematical modeling and a meta-heuristic algorithm

Jafari, Hamed; Salmasi, Nasser - In: Journal of industrial engineering international 11 (2015), pp. 439-458

The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. In this research, we focus on...

Persistent link: https://www.econbiz.de/10011562610