This paper explores algorithmic collusion from both legal and economic perspectives, underscoring the increasing influence of algorithms in firms’ market decisions and their potential to facilitate anti-competitive behaviour. By employing bandit algorithms as a model—typically used in...

As production scales up, transportation networks increasingly involve nonlinear costs, leading to the concave cost network flow problem (CCNFP), which is notably challenging due to its nonlinearity. Existing nonlinear programming methods addressing the CCNFP often suffer from low efficiency and...

This paper studies the simultaneous minimization of total weighted earliness-tardiness (TWET) and makespan in a just-in-time single-machine scheduling problem (JIT-SMSP) with sequence-dependent setup times and distinct due windows, allowing idle times in the schedules. Multiple variants of...

The role of setup times in production planning and control was recognised in the late 1960s. Since then, a growing number of scheduling problems have accounted for sequence-dependent setup time variables. This study aims to provide a systematic review of setup times in the short-term production...

In this paper, a novel message-passing algorithm, named AMP-R, based on belief propagation is proposed to solve the heterogeneous multi-depot vehicle routing problem (HMDVRP) in a distributed manner. Unlike traditional approaches, this is the first attempt to decentralize the solution process...