An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts

DOI10.1016/j.ejor.2023.01.022MaRDI QIDQ6112585

Zihua Cui, Jinhui Zhang, Yong Yin, Yuzhou Jiang, Dongni Li

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulingcompetitive ratioon-line operationresource conflicts\textit{seru}

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (2)

An exact branch-and-bound algorithm for \textit{seru} scheduling problem with sequence-dependent setup time and release date ⋮ Maximizing the throughput of a rotating Seru with nonpreemptive discrete stations

Cites Work

• Unnamed Item
• On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
• Online algorithms. The state of the art
• Logic-based Benders decomposition method for the \textit{seru} scheduling problem with sequence-dependent setup time and DeJong's learning effect
• Mathematical analysis and solutions for multi-objective line-cell conversion problem
• An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
• Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem
• An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts