Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem

M Yazdani, A Aleti, SM Khalili, F Jolai - Computers & Industrial Engineering, 2017 - Elsevier
The sum of the maximum earliness and tardiness criteria is a new objective function for the
job shop scheduling problem introduced in this work. A mixed integer linear programming …

A single-machine scheduling problem with multiple unavailability constraints: A mathematical model and an enhanced variable neighborhood search approach

M Yazdani, SM Khalili… - Journal of …, 2017 - academic.oup.com
This research focuses on a scheduling problem with multiple unavailability periods and
distinct due dates. The objective is to minimize the sum of maximum earliness and tardiness …

Distributed-elite local search based on a genetic algorithm for bi-objective job-shop scheduling under time-of-use tariffs

B Kurniawan, W Song, W Weng, S Fujimura - Evolutionary Intelligence, 2021 - Springer
The rapid growth of electricity demand has led governments around the world to implement
energy-conscious policies, such as time-of-use tariffs. The manufacturing sector can …

[PDF][PDF] Flexible job-shop scheduling problem based on hybrid ACO algorithm

J Wu, GD Wu, JJ Wang - International Journal of Simulation …, 2017 - ijsimm.com
For an enterprise to survive the fierce market competition, efficient production scheduling is
a must as it improves economic efficiency and reduces cost. As an important branch of …

[HTML][HTML] Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness

M Mahnam, G Moslehi, SMTF Ghomi - Mathematical and Computer …, 2013 - Elsevier
This paper addresses the problem of minimizing the sum of maximum earliness and
tardiness on a single machine with unequal release times and idle insert as realistic …

A parallel-machine scheduling problem with two competing agents

WC Lee, YH Chung, JY Wang - Engineering Optimization, 2017 - Taylor & Francis
Scheduling with two competing agents has become popular in recent years. Most of the
research has focused on single-machine problems. This article considers a parallel …

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

G Liu, H Wang, Y Xie - International Transactions in …, 2024 - Wiley Online Library
As the prefabrication construction method plays an increasingly important role in the
construction of cross‐sea bridges, coordinating the schedule between off‐site prefabrication …

A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine

G Moslehi, M Mahnam… - International Journal …, 2010 - inderscienceonline.com
In this paper, we consider the problem of scheduling n jobs on a single machine to minimise
the sum of maximum earliness and tardiness. Since this problem is trying to minimise the …

Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem

V Nasrollahi, G Moslehi, M Reisi-Nafchi - Operational Research, 2022 - Springer
In the past decade, multi-agent scheduling studies have become more widespread.
However, the evaluation of these issues in the flow shop scheduling environment has …

Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time

N Nekoiemehr, G Moslehi - Journal of the Operational Research …, 2011 - Taylor & Francis
This paper considers the problem of scheduling a given number of jobs on a single machine
to minimize the sum of maximum earliness and maximum tardiness when sequence …