Journal of Scheduling最新文献

Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization 在完全相同的并行机器上调度两个相互干扰的工作集，并最大限度地缩短工作周期和总完成时间

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2024-07-23 DOI: 10.1007/s10951-024-00812-1

Tifenn Rault, Faiza Sadi, Jean-Charles Billaut, Ameur Soukhal

{"title":"Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization","authors":"Tifenn Rault, Faiza Sadi, Jean-Charles Billaut, Ameur Soukhal","doi":"10.1007/s10951-024-00812-1","DOIUrl":"https://doi.org/10.1007/s10951-024-00812-1","url":null,"abstract":"We consider a two-agent scheduling problem with interfering job sets. Agent A—which can be considered as the resource manager—is associated with the whole set of jobs, and agent B—which can be considered as an application master—is associated with a subset of jobs. Each agent aims at minimizing either the maximum or the total completion time of its jobs. Considering an identical parallel machines environment, the goal is to find an assignment and a schedule of jobs which represents the best compromise between the requirements of the agents. The class of multi-agent scheduling problems has drawn a significant interest to researchers in the area of scheduling and operational research. When both agents minimize the makespan, we prove that the number of Pareto solutions is bounded and we show that this bound is reached. Using the (varepsilon )-constraint approach, we propose two integer programming formulations that allow to obtain the exact Pareto front for each problem. Given that the studied problems are NP-hard, we propose genetic algorithms (NSGA-II) to generate approximated Pareto fronts. Computational experiments are conducted to analyze the performances of the proposed methods. The results indicate that the genetic algorithms provide high-quality Pareto fronts and are computationally efficient.","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141774715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Scheduling periodic messages on a shared link without buffering 无需缓冲即可在共享链路上调度定期信息

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2024-07-16 DOI: 10.1007/s10951-024-00813-0

Maël Guiraud, Yann Strozecki

{"title":"Scheduling periodic messages on a shared link without buffering","authors":"Maël Guiraud, Yann Strozecki","doi":"10.1007/s10951-024-00813-0","DOIUrl":"https://doi.org/10.1007/s10951-024-00813-0","url":null,"abstract":"Cloud RAN, a novel architecture for modern mobile networks, relocates processing units from antenna to distant data centers. This shift introduces the challenge of ensuring low latency for the periodic messages exchanged between antennas and their respective processing units. In this study, we tackle the problem of devising an efficient periodic message assignment scheme under the constraints of fixed message size and period without contention nor buffering. We address this problem by modeling it on a common network topology, wherein contention arises from a single shared link servicing multiple antennas. While reminiscent of coupled task scheduling, the introduction of periodicity adds a unique dimension to the problem. We study how the problem behaves with regard to the load of the shared link, and we focus on proving that, for load as high as possible, a solution always exists and it can be found in polynomial time. The main contributions of this article are two polynomial time algorithms, which find a solution for messages of any size and load at most 2/5 or for messages of size one and load at most (phi - 1), the golden ratio conjugate. We also prove that a randomized greedy algorithm finds a solution on almost all instances with high probability, shedding light on the effectiveness of greedy algorithms in practical applications.","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141722479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses 自动仓库中最优分拣问题的多项式时间动态编程算法

IF 1.4 4区工程技术

Journal of Scheduling Pub Date : 2024-07-16 DOI: 10.1007/s10951-024-00811-2

Michele Barbato, A. Ceselli, G. Righini

引用次数: 0

Production scheduling decision-making technology for multiple CNC machining centers with constraints on serviceable time 多台数控加工中心的生产调度决策技术，可加工时间受限

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2024-07-13 DOI: 10.1007/s10951-024-00809-w

Jianzhong Qiu, Jun Wu, Xi Chen, Bingyan Zhao, Yan Fang

引用次数: 0

Sequential solutions in machine scheduling games 机器调度博弈中的顺序解法

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2024-05-18 DOI: 10.1007/s10951-024-00810-3

Cong Chen, Paul Giessler, Akaki Mamageishvili, Matúš Mihalák, Paolo Penna

{"title":"Sequential solutions in machine scheduling games","authors":"Cong Chen, Paul Giessler, Akaki Mamageishvili, Matúš Mihalák, Paolo Penna","doi":"10.1007/s10951-024-00810-3","DOIUrl":"https://doi.org/10.1007/s10951-024-00810-3","url":null,"abstract":"We consider the classical machine scheduling, where n jobs need to be scheduled on m machines, and where job j scheduled on machine i contributes (p_{ij}in mathbb {R}) to the load of machine i, with the goal of minimizing the makespan, i.e., the maximum load of any machine in the schedule. We study the inefficiency of schedules that are obtained when jobs arrive sequentially one by one, and the jobs choose the machine on which they will be scheduled, aiming at being scheduled on a machine with a small load. We measure the inefficiency of a schedule as the ratio of the makespan obtained in the worst-case equilibrium schedule, and of the optimum makespan. This ratio is known as the sequential price of anarchy (SPoA). We also introduce two alternative inefficiency measures, which allow for a favorable choice of the order in which the jobs make their decisions. As our first result, we disprove the conjecture of Hassin and Yovel (Oper Res Lett 43(5):530–533, 2015) claiming that the sequential price of anarchy for (m=2) machines is at most 3. We show that the sequential price of anarchy grows at least linearly with the number n of players, assuming arbitrary tie-breaking rules. That is, we show ({textbf {SPoA}} in Omega (n)). At the end of the paper, we show that if an authority can change the order of the jobs adaptively to the decisions made by the jobs so far (but cannot influence the decisions of the jobs), then there exists an adaptive ordering in which the jobs end up in an optimum schedule.","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141059216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Short-term underground mine planning with uncertain activity durations using constraint programming 利用约束编程进行活动持续时间不确定的短期地下矿山规划

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2024-04-26 DOI: 10.1007/s10951-024-00808-x

Younes Aalian, Michel Gamache, Gilles Pesant

{"title":"Short-term underground mine planning with uncertain activity durations using constraint programming","authors":"Younes Aalian, Michel Gamache, Gilles Pesant","doi":"10.1007/s10951-024-00808-x","DOIUrl":"https://doi.org/10.1007/s10951-024-00808-x","url":null,"abstract":"The short-term scheduling of activities in underground mines is an important step in mining operations. This procedure is a challenging optimization problem since it deals with many resources and activities conducted in a confined working space. Moreover, underground mining operations deal with multiple uncertainties such as the variation of activity durations. In this paper, a constraint programming (CP) model is proposed for short-term planning in underground mines. The developed model takes into account the technical requirements of underground operations to build realistic mine schedules. Furthermore, two different approaches are proposed based on the CP model for robust short-term underground mine scheduling. The first approach aims to create a robust schedule using multiple scenarios of the problem. This stochastic CP model enables to find a set of ordered robust sequences of activities performed by each available disjunctive resource over several scenarios. In the second approach, a confidence constraint is introduced in the CP model to specify the probability that the schedule generated would not underestimate the duration of activities. The model allows the mine planner to control the risk level with which an optimized solution should be produced such that it can be implemented given the actual activity durations. The presented approaches are tested on real data sets of an underground gold mine in Canada. An evaluation model is designed to evaluate the robust performance of the proposed models. The experiments demonstrate that both scenario-based and confidence-constraint approaches outperform the deterministic model by generating schedules that are more robust to uncertainties in underground operations.","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140800510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Real-world university course timetabling at the International Timetabling Competition 2019 2019 年国际课程表编制大赛上的真实世界大学课程表编制

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2024-04-12 DOI: 10.1007/s10951-023-00801-w

Tomáš Müller, Hana Rudová, Zuzana Müllerová

引用次数: 0

Quick and situ-aware spatiotemporal scheduling for shipbuilding manufacturing 用于造船业的快速和情景感知时空调度

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2024-04-06 DOI: 10.1007/s10951-024-00804-1

Junying He, Soon-Ik Hong, Seong-Hee Kim

引用次数: 0

Solving the medical student scheduling problem using simulated annealing 用模拟退火法解决医学生排课问题

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2024-04-06 DOI: 10.1007/s10951-024-00806-z

Eugenia Zanazzo, Sara Ceschia, Agostino Dovier, Andrea Schaerf

引用次数: 0

Scheduling with non-renewable resources: minimizing the sum of completion times 不可再生资源的时间安排：最小化完成时间总和

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2024-03-24 DOI: 10.1007/s10951-024-00807-y

Kristóf Bérczi, Tamás Király, Simon Omlor

{"title":"Scheduling with non-renewable resources: minimizing the sum of completion times","authors":"Kristóf Bérczi, Tamás Király, Simon Omlor","doi":"10.1007/s10951-024-00807-y","DOIUrl":"https://doi.org/10.1007/s10951-024-00807-y","url":null,"abstract":"We consider single-machine scheduling with a non-renewable resource. In this setting, we are given a set of jobs, each characterized by a processing time, a weight, and a resource requirement. At fixed points in time, certain amounts of the resource are made available to be consumed by the jobs. The goal is to assign the jobs non-preemptively to time slots on the machine, so that each job has enough resource available at the start of its processing. The objective that we consider is the minimization of the sum of weighted completion times. The main contribution of the paper is a PTAS for the case of 0 processing times ((1|rm=1,p_j=0|sum w_jC_j)). In addition, we show strong NP-hardness of the case of unit resource requirements and weights ((1|rm=1,a_j=1|sum C_j)), thus answering an open question of Györgyi and Kis. We also prove that the schedule corresponding to the Shortest Processing Time First ordering provides a 3/2-approximation for the latter problem. Finally, we investigate a variant of the problem where processing times are 0 and the resource arrival times are unknown. We present a ((4+epsilon ))-approximation algorithm, together with a ((4-varepsilon ))-inapproximability result, for any (varepsilon >0).","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140298916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0