Results 71 to 80 of about 14,397 (225)
Setup‐Optimized Sequencing in Job Shops: Modeling Workstation Productivity and Lateness Behavior
Advanced Engineering Materials, Volume 28, Issue 12, 17 June 2026.Setup‐optimized sequencing in job‐shop production creates a trade‐off between productivity improvement and schedule reliability. A WIP‐explicit modeling framework links sequencing‐induced productivity gains and lateness dispersion through the production operating curve.
Friederike Stefanowski +2 more
wiley +1 more source
The complexity of makespan minimization for pipeline transportation
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruy Luiz Milidiú +2 more
openaire +3 more sources
International Transactions in Operational Research, Volume 33, Issue 3, Page 1525-1558, May 2026.Abstract In the last decade, explainability has been attracting much attention in the machine learning community. However, this research topic extends beyond this field to encompass others such as operations research and combinatorial optimization (CO).
Mathieu Lerouge +3 more
wiley +1 more source
Makespan - Right Normal Distributed Dataset.
, 2016 Makespan - Right Normal Distributed Dataset.
Mohammed Abdullahi (846140) +1 more
core +1 more source
Approximation results for flow shop scheduling problems with machine availability constraints [PDF]
, 2009 This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing ...
Strusevich, Vitaly A. +2 more
core +1 more source
Journal of Engineering and Management in Industrial System, 2014 In the flow shop scheduling each job will go through every machine in the same order. The goal of this research is to complete a series of jobs in order to obtain the optimal makespan for stick skewers rounding machine.
Dian Setiya Widodo +2 more
doaj +1 more source
Engineering Reports, Volume 8, Issue 4, April 2026.Rat swarm position update mechanism in HRSA‐RSO, illustrating the collective exploration behavior around the prey target (A*, B*). ABSTRACT The permutation flow shop scheduling problem (PFSSP) is a classical NP‐hard problem that aims to determine an optimal job sequence across machines to minimize makespan.
Mourad Mzili +5 more
wiley +1 more source
Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation
Journal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini +3 more
wiley +1 more source
Makespan - Left Normal Distributed Dataset.
, 2016 Makespan - Left Normal Distributed Dataset.
Mohammed Abdullahi (846140) +1 more
core +1 more source
Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation
Applied Sciences, 2020 Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy.
Xuelian Pang +4 more
doaj +1 more source