Pub Date : 2023-11-06DOI: 10.1007/s10951-023-00792-8
Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan, Yaonan Wang
{"title":"Improving scheduling in multi-AGV systems by task prediction","authors":"Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan, Yaonan Wang","doi":"10.1007/s10951-023-00792-8","DOIUrl":"https://doi.org/10.1007/s10951-023-00792-8","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135589713","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}
Pub Date : 2023-10-15DOI: 10.1007/s10951-023-00793-7
Qiulan Zhao, Jinjiang Yuan
{"title":"Single-machine primary–secondary scheduling with total tardiness being the primary criterion","authors":"Qiulan Zhao, Jinjiang Yuan","doi":"10.1007/s10951-023-00793-7","DOIUrl":"https://doi.org/10.1007/s10951-023-00793-7","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136185267","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}
Pub Date : 2023-10-15DOI: 10.1007/s10951-023-00794-6
Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui
{"title":"A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment","authors":"Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui","doi":"10.1007/s10951-023-00794-6","DOIUrl":"https://doi.org/10.1007/s10951-023-00794-6","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136184889","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}
Pub Date : 2023-09-02DOI: 10.1007/s10951-023-00787-5
Helmut A. Sedding
{"title":"Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time","authors":"Helmut A. Sedding","doi":"10.1007/s10951-023-00787-5","DOIUrl":"https://doi.org/10.1007/s10951-023-00787-5","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47492117","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}
Pub Date : 2023-08-17DOI: 10.1007/s10951-023-00790-w
Li-Su Yu, Z. Tan
{"title":"Scheduling with periodic availability constraints to minimize makespan","authors":"Li-Su Yu, Z. Tan","doi":"10.1007/s10951-023-00790-w","DOIUrl":"https://doi.org/10.1007/s10951-023-00790-w","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48087944","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}
Pub Date : 2023-07-22DOI: 10.1007/s10951-023-00789-3
Michael Römer
This paper presents new mixed-integer linear programming formulations for multi-activity shift scheduling problems (MASSP). In these formulations, the rules governing shift feasibility are encoded in block-based state-expanded networks in which nodes are associated with states and arcs represent assignments of blocks of work or break periods inducing state transitions. A key advantage of these formulations is that for the anonymous MASSP in which all employees are considered as equal only a single network with integer flow variables is needed as long as the network encodes all shift composition rules. A challenging aspect is that the networks can become very large, yielding huge models that are hard to solve for large problem instances. To address this challenge, this paper proposes two exact modeling techniques that substantially reduce the size of the model instances: First, it introduces a set of aggregate side constraints enforcing that an integer flow solution can be decomposed into paths representing feasible shifts. Second, it proposes to decouple the shift composition from the assignment of concrete activities to blocks of work periods, thereby removing a large amount of symmetry from the original model. In a computational study with two MASSP instance sets from the literature dealing with shift scheduling problems, we demonstrate the effectiveness of these techniques for reducing the both size of the model instances and the solution time: We are able to solve all instances, including more than 70 previously open instances, to optimality–the vast majority of them in less than 30 min on a notebook computer.
{"title":"Block-based state-expanded network models for multi-activity shift scheduling","authors":"Michael Römer","doi":"10.1007/s10951-023-00789-3","DOIUrl":"https://doi.org/10.1007/s10951-023-00789-3","url":null,"abstract":"<p>This paper presents new mixed-integer linear programming formulations for multi-activity shift scheduling problems (MASSP). In these formulations, the rules governing shift feasibility are encoded in block-based state-expanded networks in which nodes are associated with states and arcs represent assignments of blocks of work or break periods inducing state transitions. A key advantage of these formulations is that for the anonymous MASSP in which all employees are considered as equal only a single network with integer flow variables is needed as long as the network encodes all shift composition rules. A challenging aspect is that the networks can become very large, yielding huge models that are hard to solve for large problem instances. To address this challenge, this paper proposes two exact modeling techniques that substantially reduce the size of the model instances: First, it introduces a set of aggregate side constraints enforcing that an integer flow solution can be decomposed into paths representing feasible shifts. Second, it proposes to decouple the shift composition from the assignment of concrete activities to blocks of work periods, thereby removing a large amount of symmetry from the original model. In a computational study with two MASSP instance sets from the literature dealing with shift scheduling problems, we demonstrate the effectiveness of these techniques for reducing the both size of the model instances and the solution time: We are able to solve all instances, including more than 70 previously open instances, to optimality–the vast majority of them in less than 30 min on a notebook computer.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138533297","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}
Pub Date : 2023-07-17DOI: 10.1007/s10951-023-00788-4
C. Hanen, Alix Munier Kordon
{"title":"Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines","authors":"C. Hanen, Alix Munier Kordon","doi":"10.1007/s10951-023-00788-4","DOIUrl":"https://doi.org/10.1007/s10951-023-00788-4","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41689278","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}
Pub Date : 2023-06-21DOI: 10.1007/s10951-023-00786-6
Kanthi Sarpatwar, Baruch Schieber, Hadas Shachnai
We revisit a classical scheduling model to incorporate modern trends in data center networks and cloud services. Addressing some key challenges in the allocation of shared resources to user requests (jobs) in such settings, we consider the following variants of the classic resource allocation problem (RAP). The input to our problems is a set J of jobs and a set M of homogeneous hosts, each has an available amount of some resource. Assuming that time is slotted, a job is associated with a release time, a due date, a weight and a given length, as well as its resource requirement. A feasible schedule is an allocation of the resource to a subset of the jobs, satisfying the job release times/due dates as well as the resource constraints. A crucial distinction between classic RAP and our problems is that we allow preemption and migration of jobs, motivated by virtualization techniques. We consider two natural objectives: throughput maximization (MaxT), which seeks a maximum weight subset of the jobs that can be feasibly scheduled on the hosts in M, and resource minimization (MinR), that is finding the minimum number of (homogeneous) hosts needed to feasibly schedule all jobs. Both problems are known to be NP-hard. We first present an $$Omega (1)$$ -approximation algorithm for MaxT instances where time-windows form a laminar family of intervals. We then extend the algorithm to handle instances with arbitrary time-windows, assuming there is sufficient slack for each job to be completed. For MinR we study a more general setting with d resources and derive an $$O(log d)$$ -approximation for any fixed $$d ge 1$$ , under the assumption that time-windows are not too small. This assumption can be removed leading to a slightly worse ratio of $$O(log dlog ^* T)$$ , where T is the maximum due date of any job.
我们回顾了一个经典的调度模型，以结合数据中心网络和云服务的现代趋势。为了解决在这种设置中向用户请求(作业)分配共享资源的一些关键挑战，我们考虑了经典资源分配问题(RAP)的以下变体。问题的输入是一组J个作业和一组M个同构主机，每个主机都有一定数量的可用资源。假设时间是固定的，那么作业就与发布时间、截止日期、权重和给定长度以及资源需求相关联。可行的调度是将资源分配给作业的子集，满足作业的发布时间/到期日期以及资源约束。经典RAP和我们的问题之间的一个关键区别是，我们允许由虚拟化技术驱动的作业的抢占和迁移。我们考虑两个自然目标:吞吐量最大化(MaxT)，它寻求可以在M中的主机上可行地调度的作业的最大权重子集，以及资源最小化(MinR)，即找到可行地调度所有作业所需的(同质)主机的最小数量。这两个问题都是np困难的。我们首先提出了一个$$Omega (1)$$ -近似算法的MaxT实例，其中时间窗形成层流的区间族。然后，我们扩展该算法来处理具有任意时间窗的实例，假设每个作业都有足够的空闲时间来完成。对于MinR，我们研究了具有d个资源的更一般的设置，并在假设时间窗不太小的情况下，推导出任意固定$$d ge 1$$的$$O(log d)$$ -近似。这个假设可以被删除，导致一个稍微糟糕的比率$$O(log dlog ^* T)$$，其中T是任何作业的最大到期日。
{"title":"The preemptive resource allocation problem","authors":"Kanthi Sarpatwar, Baruch Schieber, Hadas Shachnai","doi":"10.1007/s10951-023-00786-6","DOIUrl":"https://doi.org/10.1007/s10951-023-00786-6","url":null,"abstract":"We revisit a classical scheduling model to incorporate modern trends in data center networks and cloud services. Addressing some key challenges in the allocation of shared resources to user requests (jobs) in such settings, we consider the following variants of the classic resource allocation problem (RAP). The input to our problems is a set J of jobs and a set M of homogeneous hosts, each has an available amount of some resource. Assuming that time is slotted, a job is associated with a release time, a due date, a weight and a given length, as well as its resource requirement. A feasible schedule is an allocation of the resource to a subset of the jobs, satisfying the job release times/due dates as well as the resource constraints. A crucial distinction between classic RAP and our problems is that we allow preemption and migration of jobs, motivated by virtualization techniques. We consider two natural objectives: throughput maximization (MaxT), which seeks a maximum weight subset of the jobs that can be feasibly scheduled on the hosts in M, and resource minimization (MinR), that is finding the minimum number of (homogeneous) hosts needed to feasibly schedule all jobs. Both problems are known to be NP-hard. We first present an $$Omega (1)$$ -approximation algorithm for MaxT instances where time-windows form a laminar family of intervals. We then extend the algorithm to handle instances with arbitrary time-windows, assuming there is sufficient slack for each job to be completed. For MinR we study a more general setting with d resources and derive an $$O(log d)$$ -approximation for any fixed $$d ge 1$$ , under the assumption that time-windows are not too small. This assumption can be removed leading to a slightly worse ratio of $$O(log dlog ^* T)$$ , where T is the maximum due date of any job.","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136296387","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}
Pub Date : 2023-06-08DOI: 10.1007/s10951-023-00777-7
Niloy J. Mukherjee, S. Sarin, Daniel A. Neira
{"title":"Lot streaming for a two-stage assembly system in the presence of handling costs","authors":"Niloy J. Mukherjee, S. Sarin, Daniel A. Neira","doi":"10.1007/s10951-023-00777-7","DOIUrl":"https://doi.org/10.1007/s10951-023-00777-7","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52494638","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}
Pub Date : 2023-05-31DOI: 10.1007/s10951-023-00781-x
Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo
{"title":"Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits","authors":"Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo","doi":"10.1007/s10951-023-00781-x","DOIUrl":"https://doi.org/10.1007/s10951-023-00781-x","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2023-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52495073","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号