发布求助
文献互助 智能选刊 最新文献

Scheduling eJournal最新文献

筛选
英文 中文
Work Schedule Flexibility: A Contributor to Employee Happiness? 工作时间灵活性:员工幸福感的贡献者?
Scheduling eJournal Pub Date : 2013-12-01 DOI: 10.2139/ssrn.2129520
L. Golden, Julia R. Henly, S. Lambert
{"title":"Work Schedule Flexibility: A Contributor to Employee Happiness?","authors":"L. Golden, Julia R. Henly, S. Lambert","doi":"10.2139/ssrn.2129520","DOIUrl":"https://doi.org/10.2139/ssrn.2129520","url":null,"abstract":"This article contributes to knowledge regarding determinants of happiness by examining the independent role played by having discretion over one’s working time, using data pooled from two years of a nationally representative US survey. Controlling for a worker’s income bracket and work hours duration, having work schedule flexibility in the form of an ability to take time off during the work day and, to a somewhat lesser extent, to vary starting and quitting times daily, are both associated with greater happiness, whereas an ability to refuse overtime work is weak at best. The associations are generally stronger among workers paid by the hour than by salary. Worker utility functions thus may be enhanced by including the timing and flexibility of working time. Policies and practices that promote more employee-centered flexible working time may not only help workers alleviate work-life time conflicts, but also promote worker well-being generally, especially among hourly-paid workers.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114407895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
What It Means to Have a Product with Quality and What is the Cost? 拥有高质量的产品意味着什么?成本是多少?
Scheduling eJournal Pub Date : 2013-06-14 DOI: 10.2139/SSRN.2279710
Mónica Goncalves
{"title":"What It Means to Have a Product with Quality and What is the Cost?","authors":"Mónica Goncalves","doi":"10.2139/SSRN.2279710","DOIUrl":"https://doi.org/10.2139/SSRN.2279710","url":null,"abstract":"The quality of a product is becoming a topic of relevant interest as a factor of competitiveness, which is being today a goal widely recognized around the world. The increasing consumer demands and the absence of barriers to trade, make the suppliers with a lower quality in your products or services unable to survive in the current markets for long. In this article will be given the different settings to product and quality, arising from commercial or economics operations and will be related to the factor price, cost, profitability and market share.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114611837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Economic Generation Scheduling Using Genetic Algorithm 基于遗传算法的经济发电调度
Scheduling eJournal Pub Date : 2013-03-25 DOI: 10.2139/ssrn.2239221
A. Sivagami, M. Rathnakumar
{"title":"Economic Generation Scheduling Using Genetic Algorithm","authors":"A. Sivagami, M. Rathnakumar","doi":"10.2139/ssrn.2239221","DOIUrl":"https://doi.org/10.2139/ssrn.2239221","url":null,"abstract":"Genetic algorithms are adaptive search methods that simulate some of the natural processes: selection, information, inheritance, random mutation and population dynamics. This paper presents an approach based on genetic algorithm to solve the economic load dispatch (ELD) problem with losses for thermal plant systems. This approach was tested for thermal plant systems. The performance of Genetic Algorithm - intelligent approach (GAs) is observed that this method is accurate and may replace effectively the conventional practices presently performed in different central load dispatch centers.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125001469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Approximating the Multi-Level Bottleneck Assignment Problem 近似多级瓶颈分配问题
Scheduling eJournal Pub Date : 2012-02-09 DOI: 10.2139/ssrn.2001994
Trivikram Dokka, Anastasia Kouvela, F. Spieksma
{"title":"Approximating the Multi-Level Bottleneck Assignment Problem","authors":"Trivikram Dokka, Anastasia Kouvela, F. Spieksma","doi":"10.2139/ssrn.2001994","DOIUrl":"https://doi.org/10.2139/ssrn.2001994","url":null,"abstract":"We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book \"Assignment Problems\" by Burkard et al. (2009) on pages 188 - 189. One of the applications described there concerns bus driver scheduling. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximability results, depending upon the completeness of the underlying graph.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126054878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
Trajectories in Physical Space Out of Communication in Acquaintance Space: An Agent-Based Model of a Textile Industrial District 熟人空间中脱离交流的物理空间轨迹:纺织工业区基于agent的模型
Scheduling eJournal Pub Date : 2010-09-09 DOI: 10.2139/ssrn.1674843
G. Fioretti
{"title":"Trajectories in Physical Space Out of Communication in Acquaintance Space: An Agent-Based Model of a Textile Industrial District","authors":"G. Fioretti","doi":"10.2139/ssrn.1674843","DOIUrl":"https://doi.org/10.2139/ssrn.1674843","url":null,"abstract":"This article presents an agent-based model of an Italian textile district where thousands of small firms specialize in particular phases of fabrics production. It is an empirical and methodological model that reconstructs the communications between firms when they arrange production chains. In their turn, production chains reflect into road traffic in the geographical areas where the district extends. The reconstructed traffic exhibits a pattern that has been observed, but not foreseen, by policy makers.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121852487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones 基于组合锥的随机服务交付系统到达调度
Scheduling eJournal Pub Date : 2010-08-05 DOI: 10.1287/opre.2013.1158
Qingxia Kong, Chung-Yee Lee, C. Teo, Zhichao Zheng
{"title":"Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones","authors":"Qingxia Kong, Chung-Yee Lee, C. Teo, Zhichao Zheng","doi":"10.1287/opre.2013.1158","DOIUrl":"https://doi.org/10.1287/opre.2013.1158","url":null,"abstract":"In this paper we investigate a stochastic appointment-scheduling problem in an outpatient clinic with a single doctor. The number of patients and their sequence of arrivals are fixed, and the scheduling problem is to determine an appointment time for each patient. The service durations of the patients are stochastic, and only the mean and covariance estimates are known. We do not assume any exact distributional form of the service durations, and we solve for distributionally robust schedules that minimize the expectation of the weighted sum of patients' waiting time and the doctor's overtime. We formulate this scheduling problem as a convex conic optimization problem with a tractable semidefinite relaxation. Our model can be extended to handle additional support constraints of the service durations. Using the primal--dual optimality conditions, we prove several interesting structural properties of the optimal schedules. We develop an efficient semidefinite relaxation of the conic program and show that we can still obtain near-optimal solutions on benchmark instances in the existing literature. We apply our approach to develop a practical appointment schedule at an eye clinic that can significantly improve the efficiency of the appointment system in the clinic, compared to an existing schedule.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126962550","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 135
Scheduling Working Hours of Team Drivers in European Road Transport 欧洲公路运输车队司机工作时间安排
Scheduling eJournal Pub Date : 2009-11-24 DOI: 10.2139/ssrn.1532148
A. Goel
{"title":"Scheduling Working Hours of Team Drivers in European Road Transport","authors":"A. Goel","doi":"10.2139/ssrn.1532148","DOIUrl":"https://doi.org/10.2139/ssrn.1532148","url":null,"abstract":"Since April 2007 working hours of truck drivers in the European Union must comply with regulation (EC) No 561/2006. According to the new regulation, transport companies must organise the work of drivers in a way that drivers are able to comply with the regulation and can be made liable for infringements committed by the drivers. Although of particular importance in long-distance haulage, regulations on working hours of truck drivers have only received very little attention in the scheduling literature. Generating work plans complying with these regulations is a non-trivial task if service times at the locations to be visited is time constrained. This paper presents an algorithm for scheduling problems in which a team of two drivers must visit a sequence of locations within given time windows. Computational experiments demonstrate the effectiveness of the proposed method.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134361345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Truck Driver Scheduling and U.S. Hours of Service Regulations 卡车司机调度和美国服务时间规定
Scheduling eJournal Pub Date : 2009-06-03 DOI: 10.2139/ssrn.1407509
A. Goel
{"title":"Truck Driver Scheduling and U.S. Hours of Service Regulations","authors":"A. Goel","doi":"10.2139/ssrn.1407509","DOIUrl":"https://doi.org/10.2139/ssrn.1407509","url":null,"abstract":"In the United States of America driving and working hours of truck drivers must comply with the hours of service regulations imposed by the U.S. Department of Transportation. Generating work plans complying with these regulations for a given sequence of locations to be visited is a non-trivial task if the service time at these locations is time constrained. For a planning horizon of one week this paper presents an O(lambda^3) algorithm for problems in which each location must be visited within one of multiple time windows if the gap between these time windows is at least 10 hours. This situation occurs, for example, if, because of opening hours of docks, handling operations can only be performed weekdays between 8 hours and 22 hours. Furthermore, this paper presents a heuristic approach for scheduling driving and working hours of truck drivers for planning horizons of more than one week.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131512501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Multiperiod Newsvendor Problem with Partially Observed Demand 具有部分可观察需求的多时段报贩问题
Scheduling eJournal Pub Date : 2007-05-01 DOI: 10.1287/moor.1060.0236
A. Bensoussan, M. Çakanyıldırım, S. Sethi
{"title":"A Multiperiod Newsvendor Problem with Partially Observed Demand","authors":"A. Bensoussan, M. Çakanyıldırım, S. Sethi","doi":"10.1287/moor.1060.0236","DOIUrl":"https://doi.org/10.1287/moor.1060.0236","url":null,"abstract":"We consider a newsvendor problem with partially observed Markovian demand. Demand is observed if it is less than the inventory. Otherwise, only the event that it is larger than or equal to the inventory is observed. These observations are used to update the demand distribution from one period to the next. The state of the resulting dynamic programming equation is the current demand distribution, which is generally infinite dimensional. We use unnormalized probabilities to convert the nonlinear state transition equation to a linear one. This helps in proving the existence of an optimal feedback ordering policy. So as to learn more about the demand, the optimal order is set to exceed the myopic optimal order. The optimal cost decreases as the demand distribution decreases in the hazard rate order. In a special case with finitely many demand values, we characterize a near-optimal solution by establishing that the value function is piecewise linear.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"33 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133885201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 90
Airline Schedule Competition: Product-Quality Choice in a Duopoly Model 航空公司时刻表竞争:双寡头模式下的产品质量选择
Scheduling eJournal Pub Date : 2006-05-01 DOI: 10.2139/ssrn.908507
J. Brueckner, R. Flores-Fillol
{"title":"Airline Schedule Competition: Product-Quality Choice in a Duopoly Model","authors":"J. Brueckner, R. Flores-Fillol","doi":"10.2139/ssrn.908507","DOIUrl":"https://doi.org/10.2139/ssrn.908507","url":null,"abstract":"This paper presents a simple model of airline schedule competition that circumvents the complexities of the spatial approach used in earlier papers. Consumers choose between two duopoly carriers, each of which has evenly spaced flights, by comparing the combinations of fare and expected schedule delay that they offer. In contrast to the spatial approach, the particular departure times of individual flights are thus not relevant. The model generates a number of useful comparative-static predictions, while welfare analysis shows that equilibrium flight frequencies tend to be inefficiently low.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127342634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信