R. Rosati, Matteo Petris, L. Di Gaspero, Andrea Schaerf
{"title":"Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021","authors":"R. Rosati, Matteo Petris, L. Di Gaspero, Andrea Schaerf","doi":"10.1007/s10951-022-00740-y","DOIUrl":"https://doi.org/10.1007/s10951-022-00740-y","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"301 - 319"},"PeriodicalIF":2.0,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44853039","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}
{"title":"Malleable scheduling beyond identical machines","authors":"Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos","doi":"10.1007/s10951-022-00733-x","DOIUrl":"https://doi.org/10.1007/s10951-022-00733-x","url":null,"abstract":"<p>In malleable job scheduling, jobs can be executed simultaneously on multiple machines with the processing time depending on the number of allocated machines. In this setting, jobs are required to be executed non-preemptively and in unison, in the sense that they occupy, during their execution, the same time interval over all the machines of the allocated set. In this work, we study generalizations of malleable job scheduling inspired by standard scheduling on unrelated machines. Specifically, we introduce a general model of malleable job scheduling, where each machine has a (possibly different) speed for each job, and the processing time of a job <i>j</i> on a set of allocated machines <i>S</i> depends on the total speed of <i>S</i> with respect to <i>j</i>. For machines with unrelated speeds, we show that the optimal makespan cannot be approximated within a factor less than <span>(frac{e}{e-1})</span>, unless <span>(P = NP)</span>. On the positive side, we present polynomial-time algorithms with approximation ratios <span>(frac{2e}{e-1})</span> for machines with unrelated speeds, 3 for machines with uniform speeds, and 7/3 for restricted assignments on identical machines. Our algorithms are based on deterministic LP rounding. They result in sparse schedules, in the sense that each machine shares at most one job with other machines. We also prove lower bounds on the integrality gap of <span>(1+varphi )</span> for unrelated speeds (<span>(varphi )</span> is the golden ratio) and 2 for uniform speeds and restricted assignments. To indicate the generality of our approach, we show that it also yields constant factor approximation algorithms for a variant where we determine the effective speed of a set of allocated machines based on the <span>(L_p)</span> norm of their speeds.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"79 1","pages":""},"PeriodicalIF":2.0,"publicationDate":"2022-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138543732","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}
{"title":"A parallelized matheuristic for the International Timetabling Competition 2019","authors":"R. Mikkelsen, Dennis S. Holm","doi":"10.1007/s10951-022-00728-8","DOIUrl":"https://doi.org/10.1007/s10951-022-00728-8","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"429 - 452"},"PeriodicalIF":2.0,"publicationDate":"2022-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49068681","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}
{"title":"In memoriam Gerhard Woeginger","authors":"J. Lenstra, F. Rendl, F. Spieksma, M. Uetz","doi":"10.1007/s10951-022-00748-4","DOIUrl":"https://doi.org/10.1007/s10951-022-00748-4","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"503 - 505"},"PeriodicalIF":2.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48540116","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}
{"title":"Plant shutdown maintenance workforce team assignment and job scheduling","authors":"Hesham K. Alfares","doi":"10.1007/s10951-021-00718-2","DOIUrl":"https://doi.org/10.1007/s10951-021-00718-2","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"321 - 338"},"PeriodicalIF":2.0,"publicationDate":"2022-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41479975","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}
Ewa Niechwiej-Szwedo, Michael Cao, Michael Barnett-Cowan
{"title":"Binocular Viewing Facilitates Size Constancy for Grasping and Manual Estimation.","authors":"Ewa Niechwiej-Szwedo, Michael Cao, Michael Barnett-Cowan","doi":"10.3390/vision6020023","DOIUrl":"10.3390/vision6020023","url":null,"abstract":"<p><p>A prerequisite for efficient prehension is the ability to estimate an object's distance and size. While most studies demonstrate that binocular viewing is associated with a more efficient grasp programming and execution compared to monocular viewing, the factors contributing to this advantage are not fully understood. Here, we examined how binocular vision facilitates grasp scaling using two tasks: prehension and manual size estimation. Participants (<i>n</i> = 30) were asked to either reach and grasp an object or to provide an estimate of an object's size using their thumb and index finger. The objects were cylinders with a diameter of 0.5, 1.0, or 1.5 cm placed at three distances along the midline (40, 42, or 44 cm). Results from a linear regression analysis relating grip aperture to object size revealed that grip scaling during monocular viewing was reduced similarly for both grasping and estimation tasks. Additional analysis revealed that participants adopted a larger safety margin for grasping during monocular compared to binocular viewing, suggesting that monocular depth cues do not provide sufficient information about an object's properties, which consequently leads to a less efficient grasp execution.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9149857/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72925139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems","authors":"Omid Shahvari, R. Logendran, M. Tavana","doi":"10.1007/s10951-022-00729-7","DOIUrl":"https://doi.org/10.1007/s10951-022-00729-7","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"589-621"},"PeriodicalIF":2.0,"publicationDate":"2022-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46988253","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}
{"title":"The flexibility of home away pattern sets","authors":"R. Lambers, Dries R. Goossens, F. Spieksma","doi":"10.1007/s10951-022-00734-w","DOIUrl":"https://doi.org/10.1007/s10951-022-00734-w","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"26 1","pages":"413 - 423"},"PeriodicalIF":2.0,"publicationDate":"2022-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44757847","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}
Johannes Vass, Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Felix Winter
{"title":"Exact and meta-heuristic approaches for the production leveling problem","authors":"Johannes Vass, Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Felix Winter","doi":"10.1007/s10951-022-00721-1","DOIUrl":"https://doi.org/10.1007/s10951-022-00721-1","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"339 - 370"},"PeriodicalIF":2.0,"publicationDate":"2022-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42529887","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}
{"title":"A reinforcement learning algorithm for rescheduling preempted tasks in fog nodes","authors":"Biji Nair, S. M. Bhanu","doi":"10.1007/s10951-022-00725-x","DOIUrl":"https://doi.org/10.1007/s10951-022-00725-x","url":null,"abstract":"","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":"25 1","pages":"547 - 565"},"PeriodicalIF":2.0,"publicationDate":"2022-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46889570","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}