Journal of Scheduling最新文献_第3页

Improving scheduling in multi-AGV systems by task prediction 基于任务预测的多agv系统调度改进

4区工程技术

Journal of Scheduling Pub Date : 2023-11-06 DOI: 10.1007/s10951-023-00792-8

Hongkai Fan, Dong Li, Bo Ouyang, Zhi Yan, Yaonan Wang

引用次数: 0

Single-machine primary–secondary scheduling with total tardiness being the primary criterion 以总延迟为主要标准的单机主从调度

4区工程技术

Journal of Scheduling Pub Date : 2023-10-15 DOI: 10.1007/s10951-023-00793-7

Qiulan Zhao, Jinjiang Yuan

引用次数: 0

A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment 弹性工作环境下人员调度的并行破坏与重建启发式

4区工程技术

Journal of Scheduling Pub Date : 2023-10-15 DOI: 10.1007/s10951-023-00794-6

Rachid Hassani, Guy Desaulniers, Issmail Elhallaoui

引用次数: 0

Mixed-model moving assembly line material placement optimization for a shorter time-dependent worker walking time 针对较短时间依赖性工人步行时间的混合模型移动装配线材料放置优化

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2023-09-02 DOI: 10.1007/s10951-023-00787-5

Helmut A. Sedding

引用次数: 0

Scheduling with periodic availability constraints to minimize makespan 具有周期性可用性约束的调度，以最大限度地缩短完工时间

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2023-08-17 DOI: 10.1007/s10951-023-00790-w

Li-Su Yu, Z. Tan

引用次数: 0

Block-based state-expanded network models for multi-activity shift scheduling 多活动轮班调度的基于块的状态扩展网络模型

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2023-07-22 DOI: 10.1007/s10951-023-00789-3

Michael Römer

{"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}

引用次数: 0

Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines 受发布时间和截止日期约束的调度相关类型任务的固定参数可跟踪性

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2023-07-17 DOI: 10.1007/s10951-023-00788-4

C. Hanen, Alix Munier Kordon

引用次数: 2

The preemptive resource allocation problem 抢占式资源分配问题

4区工程技术

Journal of Scheduling Pub Date : 2023-06-21 DOI: 10.1007/s10951-023-00786-6

Kanthi Sarpatwar, Baruch Schieber, Hadas Shachnai

{"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}

引用次数: 0

Lot streaming for a two-stage assembly system in the presence of handling costs 在处理成本存在的情况下，两阶段装配系统的批次流

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2023-06-08 DOI: 10.1007/s10951-023-00777-7

Niloy J. Mukherjee, S. Sarin, Daniel A. Neira

引用次数: 1

Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits 双准则双机流水车间调度:近似算法及其限制

IF 2 4区工程技术

Journal of Scheduling Pub Date : 2023-05-31 DOI: 10.1007/s10951-023-00781-x

Xiaojuan Jiang, Kangbok Lee, Michael L. Pinedo

引用次数: 0