{"title":"Scheduling through Group Decision Support with Adaptive Hypermedia","authors":"A. Almeida, C. Martins, G. Marreiros","doi":"10.1109/SCIS.2007.367677","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367677","url":null,"abstract":"This paper aims is to present an ongoing project which proposes a new methodology and architecture for collaborative scheduling through adaptive hypermedia and group decision support. The approach to the problem is new in a sense that the techniques of user modelling, adaptive system and group decision support will be used and adapted to the scheduling process in manufacturing environments. A scheduling module outputs a set of candidate scheduling solutions, each generated based on specific criteria and/or by a particular method. Scheduling is a multi-criteria decision problem in practice where different schedulers may agree on key objectives but differ greatly on their relative importance in a particular situation. The selection of a scheduling solution is achieved through the interaction among scheduling actors which is supported by a group decision support module considering the different necessities and the diversity of information source of each group or individual user","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133612357","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}
{"title":"Super 14 Rugby Fixture Scheduling Using a Multi-Objective Evolutionary Algorithm","authors":"R. L. While, L. Barone","doi":"10.1109/SCIS.2007.367667","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367667","url":null,"abstract":"Super 14 Rugby is not only a popular game, but also a hugely profitable business. However, determining a schedule for games in the competition is very difficult, as a number of different, often conflicting, factors must be considered. We propose the use of a multi-objective evolutionary algorithm for deciding such a schedule. We detail the technical details needed to apply a multi-objective evolutionary algorithm to this problem and report on experiments that show the effectiveness of this approach. We compare solutions found by our approach with recent fixtures employed by the organising authority; our results showing significant improvements over the existing solutions","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126804208","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}
{"title":"A Genetic Algorithm with Dominance Properties for Single Machine Scheduling Problems","authors":"Shih-Shin Chen, P. Chang, Shih-Min Hsiung, C. Fan","doi":"10.1109/SCIS.2007.367676","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367676","url":null,"abstract":"This paper considers a single machine scheduling problem in which n jobs are to be processed and a machine setup time is required when the machine switches jobs from one to the other. All jobs have a common due date that has been predetermined using the median of the set of sequenced jobs. The objective is to find an optimal sequence of the set of n jobs to minimize the sum of the job's setups and the cost of tardy or early jobs related to the common due date. Dominance properties are developed according to the sequence swapping of two neighborhood jobs. These dominance properties are further embedded in the simple genetic algorithm to improve the efficiency and effectiveness of the global searching procedure. Analytical results in benchmark problems are presented and computational algorithms are developed","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127249535","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}
{"title":"Scheduling Coupled-Tasks on a Single Machine","authors":"Haibing Li, Hairong Zhao","doi":"10.1109/SCIS.2007.367681","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367681","url":null,"abstract":"In this paper, we consider the coupled-task scheduling problem, to schedule n jobs on a single machine. Each job consists of two coupled tasks which have to be processed in a predetermined order and at exactly a specified interval apart. The objective is to minimize the makespan. The problem was shown to be NP-hard in the strong sense even for some special cases. We analyze some heuristics with worst-case bounds for some NP-hard cases. In addition, we present a tabu search meta-heuristic for solving the general case. Computational results show that the meta-heuristic is efficient to solve the problem in terms of solution quality and running time","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131808556","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}
{"title":"Local Rescheduling - A Novel Approach for Efficient Response to Schedule Disruptions","authors":"J. Kuster, D. Jannach, G. Friedrich","doi":"10.1109/SCIS.2007.367673","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367673","url":null,"abstract":"Whenever an unforeseen disturbance occurs during the execution of scheduled operations, rescheduling might be necessary: Beside temporal shifts and the allocation of alternative resources, also potential switches from one process variant to another one have typically to be considered. In realistic scenarios of operational disruption management (DM) the high number of potential options makes the provision of online decision support complex. It is thus necessary to significantly reduce the size of the regarded (search) problems which can for instance be achieved by applying methods of partial rescheduling. However, existing approaches such as affected operations rescheduling (AOR) or matchup scheduling (MUP) focus on production-specific problems and can not be applied to more generic problem classes. To overcome this limitation, we introduce a novel approach to partial rescheduling in this paper: local rescheduling (LRS) is based on the incremental extension of a time window which is regarded for potential schedule modifications. We discuss how this time window can be initialized, extended and used for rescheduling. Moreover, we illustrate the superior performance of LRS in comparison with full rescheduling and MUP","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134316156","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}
{"title":"An Ant Colony Optimization Approach to the Minimum Tool Switching Instant Problem in Flexible Manufacturing System","authors":"A. Konak, S. Kulturel-Konak","doi":"10.1109/SCIS.2007.367668","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367668","url":null,"abstract":"Efficient tool management is very important for the productivity in flexible manufacturing systems. This paper proposes an ant colony approach to minimize the number of tool switching instants in flexible manufacturing systems for the first time. The proposed approach is compared to optimal results from the literature, and very promising results are reported.","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131973677","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}
{"title":"Efficient Scheduling Focusing on the Duality of MPL Representation","authors":"H. Goto, Yusuke Hasegawa, Masakichi Tanaka","doi":"10.1109/SCIS.2007.367670","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367670","url":null,"abstract":"A max-plus linear (MPL) representation for describing the behavior of a repetitious execution system with a MIMO-FIFO structure is proposed. A conventional MPL form is required to recalculate the representation matrices by each job when applied to systems whose processing times differ by each job. Approximately twice the calculation volume is required to obtain the earliest and latest times using conventional MPL compared with our proposed MPL representation. This work assigns the state variables to events other than conventional ones, reduces the number of independent system parameters in representation matrices, and improves the form to schedule efficiently, even when applied to systems whose processing times differ by each job. The derived equations are similar to the dual system in modern control theory, which means that the calculation load for scheduling can be reduced remarkably comparing with the conventional method","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122852518","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}
{"title":"Rolling Partial Rescheduling Driven by Disruptions on Single-machine Based on Genetic Algorithm","authors":"Bing Wang, Xiaoying Hong","doi":"10.1109/SCIS.2007.367672","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367672","url":null,"abstract":"This paper discusses large-scale single-machine rescheduling problems with efficiency and stability as bi-criterion, where more than one disruption arises during the execution of an initial schedule. Partial rescheduling (PR), which involves only partial unfinished schedules, is adopted in response to each disruption and forms a PR sub-problem. The remaining unfinished schedule is just right-shifted or not following the solution of PR sub-problem. During the process of schedule execution, a rolling PR strategy is driven by disruption events. Each global rescheduling consisting of two segments of local rescheduling revises the original schedule into a new schedule, which is exactly the next original schedule. Two types of local objective functions are designed for PR sub-problems locating in the process or the terminal of original schedules respectively, where the global information of bi-criterion problems is reflected to an extent. The analytical results demonstrate that each local PR objective is consistent to the global one. For PR sub-problems with such a particular criteria, a genetic algorithm is used to solve it. Extensive computational experiments were performed. Computational results show that the rolling PR can greatly improve schedule stability with a little sacrifice in schedule efficiency and consistently outperforms the rolling right-shift rescheduling. The rolling PR strategy is effective to address large-scale rescheduling problems with more disruptions","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"34 13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123145445","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}
{"title":"Refinery Scheduling Optimization using Genetic Algorithms and Cooperative Coevolution","authors":"Leonard M. Sim, D. Dias, M. Pacheco","doi":"10.1109/SCIS.2007.367683","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367683","url":null,"abstract":"Oil refineries are one of the most important examples of multiproduct continuous plants, that is, a continuous processing system that generates a number of products simultaneously. A refinery processes various crude oil types and produces a wide range of products. It is a complex optimization problem, mainly due to the number of different tasks involved and different objective criteria. In addition, some of the tasks have precedence constraints that require other tasks to be scheduled first. In this paper the refinery scheduling problem is addressed using genetic algorithms and cooperative coevolution. A simple refinery, with commonly found types of equipments, tasks and constraints of a real refinery, was created. Three test scenarios were designed with different sizes, demands and constraints. In all of them, the results obtained were far better than the ones obtained through random search","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115070092","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}
{"title":"An Order Based Evolutionary Approach to Dual Objective Examination Timetabling","authors":"C. Mumford","doi":"10.1109/SCIS.2007.367687","DOIUrl":"https://doi.org/10.1109/SCIS.2007.367687","url":null,"abstract":"This paper explores a simple bi-objective evolutionary approach to the examination timetabling problem. The new algorithm handles two hard constraints: 1) avoiding examination clashes and 2) respecting the given maximum seating capacity; while simultaneously minimizing two objective functions: 1) the overall length of the examination period and 2) the total proximity cost An order based representation with a greedy decoder ensures that neither of the hard constraints is violated, and produces only feasible timetables. At the same time the dual objectives are attacked and the multi-objective evolutionary algorithm (MOEA) attempts to pack all the examinations into as short a period as possible while, at the same time, favoring a good spread of examinations for individual students. Most other published timetabling algorithms require the number time slots to be fixed in advance of any optimization for soft constraints, such as proximity costs. Smart genetic and heuristic operators used in the present study ensure that a good set of non-dominated results is produced by the new MOEA, covering a range of timetable lengths","PeriodicalId":184726,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence in Scheduling","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129820399","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}