• Home
  • Search
  • A batch scheduling model on unrelated parallel machines with resource constraints and sequence-dependent setup time to minimize total actual flow time
  • Cite Icon1
  • https://doi.org/10.3926/jiem.8710Copy DOI Icon

A batch scheduling model on unrelated parallel machines with resource constraints and sequence-dependent setup time to minimize total actual flow time

Show More
  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

Findings: The proposed algorithm achieves an average efficiency of 99.32% compared to the enumeration algorithm, with minimal deviation (0.4%). The results validate the main proposition for efficient scheduling, including prioritizing jobs based on due dates, allocating job demands based on machine capacity, and sequencing batches based on size to minimize delays.Research limitations/implications: The model assumes static machine conditions and predefined job parameters, limiting its applicability in dynamic environments. Future research can extend this approach to incorporate real-time job arrivals or machine breakdown scenarios.Practical implications: This algorithm provides a practical tool for industries to optimize batch scheduling on unrelated parallel machines, improving production efficiency and reducing operational costs.Social implications: By improving production scheduling, this model indirectly supports sustainable manufacturing practices through optimal resource utilization.Originality/value: This study introduces a novel integration of backward scheduling with resource constraints and sequence-dependent setup times, addressing gaps in scheduling research for unrelated parallel machines.

Similar Papers
  • Research Article
  • Citations18

A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem

  • Feb 21, 2017
  • Sādhanā
  • V K Manupati +3
  • PDF
  • Research Article
  • Citations5

An Iterated Population-Based Metaheuristic for Order Acceptance and Scheduling in Unrelated Parallel Machines with Several Practical Constraints

  • Mar 16, 2023
  • Mathematics
  • Chun-Lung Chen
  • Research Article
  • Citations103

A rolling horizon job shop rescheduling strategy in the dynamic environment

  • Mar 01, 1997
  • The International Journal of Advanced Manufacturing Technology
  • Jian Fang +1
  • Research Article
  • Citations58

Solving comprehensive dynamic job shop scheduling problem by using a GRASP-based approach

  • Mar 23, 2017
  • International Journal of Production Research
  • Adil Baykasoğlu +1
  • PDF
  • Research Article
  • Citations13

Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach

  • Nov 27, 2017
  • Journal of Industrial Engineering and Management
  • Hassan Jafarzadeh +2
  • Research Article
  • Citations9

Minimizing earliness and tardiness costs in scheduling jobs with time windows

  • Dec 27, 2016
  • Computers & Industrial Engineering
  • Yi-Feng Hung +2
  • Research Article
  • Citations38

An immune-inspired algorithm for an unrelated parallel machines’ scheduling problem with sequence and machine dependent setup-times for makespan minimisation

  • Apr 04, 2015
  • Neurocomputing
  • Rodney Oliveira Marinho Diana +3
  • Research Article
  • Citations5

Metaheuristics for Scheduling Unrelated Parallel Machines with Sequence-Dependent Setup Time and Machine Eligibility

  • Jan 01, 2015
  • Chiang Mai University Journal of Natural Sciences
  • Karn Moonsri +2
  • Research Article
  • Citations13

A Variable Neighborhood Descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times

  • Apr 01, 2018
  • Electronic Notes in Discrete Mathematics
  • Rodney O.M Diana +2
  • Book Chapter

Ant Colony Algorithm Based Scheduling with Lot-Sizing for Printed Circuit Board Assembly Shop

  • Jan 01, 2019
  • Zilong Zhuang +3
  • Research Article
  • Citations35

Hybrid intelligent water drops algorithm to unrelated parallel machines scheduling problem: a just-in-time approach

  • Jun 04, 2014
  • International Journal of Production Research
  • Vahid Kayvanfar +1
  • Research Article
  • Citations7

A New Mathematical Model for Fuzzy Flexible Flow Shop Scheduling of Unrelated Parallel Machines Maximizing the Weighted Satisfaction Level

  • Jan 01, 2009
  • IFAC Proceedings Volumes
  • N Rezaie +2
  • PDF
  • Research Article
  • Citations17

Integrated maintenance and production scheduling for unrelated parallel machines with setup times

  • Oct 18, 2023
  • Flexible Services and Manufacturing Journal
  • Michael Geurtsen +2
  • Book Chapter
  • Citations3

Makespan Minimization for Scheduling Unrelated Parallel Machine with Sequence-Dependent Setup Time

  • Jan 01, 2015
  • Karn Moonsri +1
  • Research Article
  • Citations32

Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times

  • May 24, 2021
  • Applied Soft Computing
  • Raka Jovanovic +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.