Flow shop scheduling problems with assembly operations: a review and new trends

GM Komaki, S Sheikh, B Malakooti - International Journal of …, 2019 - Taylor & Francis
The past few years have witnessed a resurgence of interest in assembly flow shop
scheduling as evidenced by increasing number of published articles in this field. A basic …

Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review

GA Rolim, MS Nagano - Computers & Industrial Engineering, 2020 - Elsevier
This paper deals with earliness and tardiness scheduling around common due dates and
windows. Related problems share a strong practical importance due to the endogenous and …

Grey Wolf Optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time

GM Komaki, V Kayvanfar - Journal of computational science, 2015 - Elsevier
This article addresses the two-stage assembly flow shop scheduling problem with release
time of jobs which is applicable in many industrial areas, such as computer manufacturing …

An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times

C Lu, X Li, L Gao, W Liao, J Yi - Computers & Industrial Engineering, 2017 - Elsevier
The scheduling problems with controllable processing times (CPT) are commonly
encountered in some manufacturing industries. CPT means the processing times of …

A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry

S Jiang, M Liu, J Hao, W Qian - Computers & Industrial Engineering, 2015 - Elsevier
A steelmaking-continuous casting (SCC) scheduling problem is an example of complex
hybrid flow shop scheduling problem (HFSSP) with a strong industrial background. This …

Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension

B Alidaee, H Li, H Wang, K Womer - Omega, 2021 - Elsevier
Scheduling with arbitrary due dates and no idle time permitted between jobs with the
objective of minimizing the total earliness and tardiness has a variety of industry …

Optimization of rewards in single machine scheduling in the rewards-driven systems

A Gharaei, B Naderi… - Management Science …, 2015 - m.growingscience.com
The single machine scheduling problem aims at obtaining the best sequence for a set of
jobs in a manufacturing system with a single machine. In this paper, we optimize rewards in …

Multi‐objective optimization for stochastic failure‐prone job shop scheduling problem via hybrid of NSGA‐II and simulation method

SS Amelian, SM Sajadi, M Navabakhsh… - Expert …, 2022 - Wiley Online Library
Production scheduling and reliability of machinery are prominent issues in flexible
manufacturing systems that are led to decreasing of production costs and increasing of …

Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times

V Kayvanfar, GHM Komaki, A Aalaei… - Computers & Operations …, 2014 - Elsevier
Job scheduling has always been a challenging task in modern manufacturing and the most
real life scheduling problems which involves multi-criteria and multi-machine environments …

An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach

V Kayvanfar, M Zandieh, E Teymourian - Computational and Applied …, 2017 - Springer
Identical parallel machine scheduling problem with controllable processing times is
investigated in this research. In such an area, our focus is mostly motivated by the adoption …