Bi-Objective Parallel Batch Scheduling with Two-Level Incompatibility and Asymmetric Sequence-Dependent Setup Times: A Sustainable Textile Dyeing Application

Cleaning dye vessels between colour changes consumes water, chemicals, and energy. We study its trade-off with on-time delivery in a bi-objective parallel batch scheduling problem with two simultaneous compatibility restrictions, colour family and customer, and asymmetric sequence-dependent setup times; total setup time serves as the proxy for cleaning. We give a mixed-integer formulation, show that each criterion is strongly NP-hard, and propose a two-stage metaheuristic that forms batches and then sequences them by a tabu search coupled to the ε-constraint bound, generating approximation fronts (sets of mutually non-dominated schedules). On 120 instances, each solved five times under equal computing time, the method attains the highest hypervolume against adaptive large neighbourhood search and the non-dominated sorting genetic algorithm II (NSGA-II) on every instance, and on 115 when normalised by a current-practice dispatching rule. Its hypervolume margin over NSGA-II grows from 0.10 at 30 to 0.24 at 100 jobs, and it is larger still without the annealing step of its batching stage. Against the dispatching rule, its fronts offer on average 42% less tardiness without more setup time, or 86% less setup time without more tardiness. On the 11 small instances (up to 10 jobs) with a known optimum, its tardiness-minimal schedule is optimal; other points are not certified.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-11-19
DOI
https://doi.org/10.3390/math14224260
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Bi-Objective Parallel Batch Scheduling with Two-Level Incompatibility and Asymmetric Sequence-Dependent Setup Times: A Sustainable Textile Dyeing Application

Abdullah Hulusi Kökçam, Çağrı Sel, Muhammed Zahid KOÇ
Mathematics
Scheduling and Optimization Algorithms
article

Bi-Objective Parallel Batch Scheduling with Two-Level Incompatibility and Asymmetric Sequence-Dependent Setup Times: A Sustainable Textile Dyeing Application

Abdullah Hulusi Kökçam, Çağrı Sel, Muhammed Zahid KOÇ
article en

Abstract

Cleaning dye vessels between colour changes consumes water, chemicals, and energy. We study its trade-off with on-time delivery in a bi-objective parallel batch scheduling problem with two simultaneous compatibility restrictions, colour family and customer, and asymmetric sequence-dependent setup times; total setup time serves as the proxy for cleaning. We give a mixed-integer formulation, show that each criterion is strongly NP-hard, and propose a two-stage metaheuristic that forms batches and then sequences them by a tabu search coupled to the ε-constraint bound, generating approximation fronts (sets of mutually non-dominated schedules). On 120 instances, each solved five times under equal computing time, the method attains the highest hypervolume against adaptive large neighbourhood search and the non-dominated sorting genetic algorithm II (NSGA-II) on every instance, and on 115 when normalised by a current-practice dispatching rule. Its hypervolume margin over NSGA-II grows from 0.10 at 30 to 0.24 at 100 jobs, and it is larger still without the annealing step of its batching stage. Against the dispatching rule, its fronts offer on average 42% less tardiness without more setup time, or 86% less setup time without more tardiness. On the 11 small instances (up to 10 jobs) with a known optimum, its tardiness-minimal schedule is optimal; other points are not certified.

MathematicsVol. 14(22)
Sakarya University (TR), Karabük University (TR)
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon