Results 31 to 40 of about 14,397 (225)

Minimizing makespan in a pallet-constrained flowshop [PDF]

, 1998
We consider the problem of scheduling n jobs in a pallet-constrained flowshop so as to minimize the makespan. In such a flowshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of the last ...
Sriskandarajah, C., Sethi, S.P., Velde, van de, S.L., Wang, M.Y., Hoogeveen, J.A.   +4 more
core   +3 more sources

A Self-Adaptive Memetic Algorithm for Distributed Job Shop Scheduling Problem

Mathematics
Distributed scheduling has become a common manufacturing mode, and the distributed job scheduling problem (DJSP) has attracted more manufacturers and researchers in the field of operation research.
Guangchen Wang, Peng Wang, Honggang Zhang   +2 more
doaj   +1 more source

Task stalling for a batch of task makespan minimisation in heterogeneous multigrid computing

Computational Science and Techniques, 2021
This paper presents a new algorithm for a batch of task makespan minimisation in heterogeneous multigrid computing. Heterogeneous grids are known to cause straggling task problem that increases task execution makespan.
Albertas Jurgelevičius, Leonidas Sakalauskas, Virginijus Marcinkevičius   +2 more
doaj   +1 more source

Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

Jurnal Teknik Industri, 2023
This research examined the scheduling of jobs with multiple stages unto identical parallel machines to minimize the makespan. The work is motivated by a Flexible Manufacturing System case that produces various parts and has multiple machining centers ...
Eka Pakpahan, Kenneth David Sumarna
doaj   +1 more source

Production Time Optimization using Campbell Dudek Smith (CDS) Algorithm for Production Scheduling [PDF]

E3S Web of Conferences, 2019
The production time optimization study used the Campbell Dudek smith (CDS) algorithm in the production process scheduling aimed at makespan optimization for engine operation to produce 12-size pan products, 14-size griddle, 16-size griddle, 18-size ...
Mashuri Chamdan, Mujianto Ahmad Heru, Sucipto Hadi, Arsam Rinaldo Yudianto, Permadi Ginanjar Setyo   +4 more
doaj   +1 more source

A Novel Two‐Stage Flexible Flow Shop Batch Scheduling Model for Grinding Workshops

Naval Research Logistics (NRL), EarlyView.
ABSTRACT The growing need for data storage in data centers has increased the demand for mechanical hard disks due to their low cost and high reliability. Aluminum substrates are the most popular base plates for mechanical hard disks because of their high hardness and low cost.
Jun Xu, Xuanru Pan, Chao‐Bo Yan, Guo‐Qiang Fan, Zhixin Liu   +4 more
wiley   +1 more source

Multiobjective Task Scheduling in Cloud Environment Using Decision Tree Algorithm

IEEE Access, 2022
In recent years, Cloud computing has been developed and become the foundation of a wide range of applications. It allows users to access a catalog of standardized services and respond to their business needs flexibly and adaptively, in the event of ...
Hadeer Mahmoud, Mostafa Thabet, Mohamed H. Khafagy, Fatma A. Omara   +3 more
doaj   +1 more source

M3RS: Multi‐Robot, Multi‐Objective, and Multi‐Mode Routing and Scheduling

Journal of Field Robotics, EarlyView.
ABSTRACT Task execution quality significantly impacts multi‐robot missions, yet existing task allocation frameworks rarely consider quality of service as a decision variable, despite its importance in applications like robotic disinfection and cleaning. We introduce the multi‐robot, multi‐objective, and multi‐mode routing and scheduling (M3RS) problem,
Ishaan Mehta, Junseo Kim, Sharareh Taghipour, Sajad Saeedi   +3 more
wiley   +1 more source

Makespan Minimization via Posted Prices [PDF]

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
We consider job scheduling settings, with multiple machines, where jobs arrive online and choose a machine selfishly so as to minimize their cost. Our objective is the classic makespan minimization objective, which corresponds to the completion time of the last job to complete. The incentives of the selfish jobs may lead to poor performance.
Michal Feldman, Amos Fiat, Alan Roytman
openaire   +4 more sources

Exact and metaheuristic approaches to minimizing makespan in parallel machine scheduling with conflicting jobs

International Transactions in Operational Research, EarlyView.
Abstract We address the scheduling conflicting jobs on parallel identical machines problem with makespan minimization, a classical and computationally challenging variant of parallel machine scheduling. We develop and evaluate three distinct solution methodologies: a novel constraint programming (CP) formulation, and two metaheuristics: a multi ...
Roberto Maria Rosati, Dinh Quy Ta, Minh Hoàng Hà, Andrea Schaerf   +3 more
wiley   +1 more source