Results 51 to 60 of about 22,096 (146)

Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines

open access: yes, 2011
We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job $j$ has a length $l_{j}$ and each machine $i$ has a private speed $t_{i}$.
Fleischer, Lisa, Wang, Zhenghui
core   +2 more sources

Minimizing makespan in hybrid flowshops

open access: yesOperations Research Letters, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA ( host institution )   +2 more
openaire   +3 more sources

Mapping Quantum Computing Techniques for NP‐Hard Problems in Operations Management and Operations Research

open access: yesEngineering Reports, Volume 8, Issue 2, February 2026.
Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad   +3 more
wiley   +1 more source

Genetic Algorithm Based Multipath Optimization for Multimobile Robot Navigations

open access: yesEngineering Reports, Volume 8, Issue 2, February 2026.
Multimobile Robot Flow Network Problem (MMRNP) is to find optimum navigation paths in a network without robot collisions. In this paper, we present a heuristic approach using Genetic Algorithm (GA) to achieve the near‐optimal solution. We propose a new population initialization for our GA with different operators.
K. Somasundaram, Juha Plosila
wiley   +1 more source

Reinforcement Learning‐Assisted Meta‐Heuristics for Scheduling Job Shops With Material Handling Robots

open access: yesIET Collaborative Intelligent Manufacturing, Volume 8, Issue 1, January/December 2026.
This study addresses an integrated job shop scheduling problem with material handling robots, aiming to minimise the maximum completion time. Three meta‐heuristics, seven local search strategies and two reinforcement learning algorithms are proposed to solve the problems.
Qi Jia   +3 more
wiley   +1 more source

Time‐ and Behaviour‐Preserving Execution of Determinate Supervisory Control

open access: yesIET Cyber-Physical Systems: Theory &Applications, Volume 11, Issue 1, January/December 2026.
The activity framework is a model‐based framework incorporating a model of activities with determinate timing and behaviour, and a strong mathematical foundation based on max‐plus algebra that allows efficient timing analysis and optimisation of CPS. Preserving the specified behaviour and the model‐predicted timing in an implementation is challenging ...
Alireza Mohamadkhani   +3 more
wiley   +1 more source

A deterministic truthful PTAS for scheduling related machines

open access: yes, 2009
Scheduling on related machines ($Q||C_{\max}$) is one of the most important problems in the field of Algorithmic Mechanism Design. Each machine is controlled by a selfish agent and her valuation can be expressed via a single parameter, her {\em speed ...
Christodoulou, George, Kovacs, Annamaria
core   +2 more sources

A Two‐Stage Optimization Model for Multiple‐Crane Service Schedules Problem

open access: yesAdvances in Civil Engineering, Volume 2026, Issue 1, 2026.
Scheduling tower crane movements is essential in a large construction site where multiple cranes are deployed. Efficient planning can avoid potential crane collisions, reduce construction duration, and save energy consumption. The multiple‐crane service schedules problem (MCSSP) is a classic combinatorial problem.
Wen-Qi Wang   +6 more
wiley   +1 more source

Optimizing the Number of Cells and Makespan in Cellular Manufacturing System

open access: yesJournal of Engineering, Volume 2026, Issue 1, 2026.
In the competitive shoe manufacturing industry, efficient production scheduling often struggles to balance minimizing makespan (MS) and reducing the number of cells, leading to increased complexity. This study introduces a biobjective optimization model to minimize the MS and the number of cells in a cellular manufacturing (CM) system.
Ibrahim Mousad   +4 more
wiley   +1 more source

Human‐Centric Job‐Shop Production Planning and Scheduling System Based on the Concept of I5.0

open access: yesJournal of Engineering, Volume 2026, Issue 1, 2026.
Production systems must constantly adapt to changing conditions, requiring planners to make complex decisions under uncertainty that significantly impact operational and financial performance. While digitalization of Production Planning and Scheduling (PPS) has been widely adopted using Artificial Intelligence (AI) and machine learning in Industry 4.0 (
Waqas Javaid   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy