605,998 Hits in 5.9 sec

A solution to the university course timetabling problem using a hybrid method based on genetic algorithms

Javier Arias-Osorio, Andrés Mora-Esquivel
2020 Dyna  
at the Industrial University of Santander, obtaining interesting solutions in a reasonable computational time, being that the process of organizing the schedule by the coordinator can last from hours  ...  Algorithm with the strategy of intensification of the Tabu Search Algorithm.  ...  This metaheuristic was tested with 11 instances of 'Socha benchmark' achieving the best solutions registered to date in two of the most complex instances.  ... 
doi:10.15446/dyna.v87n215.85933 fatcat:hpim4ftwszeubiybybmaadziia

Towards a planning board generator

Marc Wennink, Martin Savelsbergh
1996 Decision Support Systems  
In this paper we discuss our view of a planning board generator and introduce a method to describe problem instances and types.  ...  A planning board generator aims at facilitating the development of planning boards using a description of the problem type for which a planning board is to be developed and the desired representations  ...  a task is assigned to two m a c hines would satisfy this restriction.  ... 
doi:10.1016/0167-9236(95)00032-1 fatcat:7yjdwc6gh5bj5hbldwk6fvr2pe

Parallel Machine Scheduling with Nested Processing Set Restrictions and Job Delivery Times

Shuguang Li
2016 Mathematical Problems in Engineering  
The problem of scheduling jobs with delivery times on parallel machines is studied, where each job can only be processed on a specific subset of the machines called its processing set.  ...  Two distinct processing sets are either nested or disjoint; that is, they do not partially overlap. All jobs are available for processing at time 0.  ...  Acknowledgments This work is supported by the National Natural Science Foundation of China (nos. 61373079, 61472227, 61272244, and 61672327), Key Project of Chinese Ministry of Education (no. 212101),  ... 
doi:10.1155/2016/3203728 fatcat:zly2456hfndipka7e7fxnag6ru

Mapping the Interface Description Language type model into C

K. Shannon, R. Snodgrass
1989 IEEE Transactions on Software Engineering  
The Interface Description Language (IDL) is a notation for describing the characteristics of data structures passed among collections of cooperating processes in a programming environment.  ...  In this paper we discuss a mapping from IDL to C data structures and macro definitions that supports the full language and is type safe and runtime efficient, but is not particularly compile-time efficient  ...  Newcomer, who provided valuable feedback and insight in many discussions; and the early users of our tools. D. Lamb and a refree provided valuable comments on a previous draft of this paper.  ... 
doi:10.1109/32.41327 fatcat:qu3soedbyvhcxpoek3zpu5leie

On some special cases of the restricted assignment problem

Chao Wang, René Sitters
2016 Information Processing Letters  
We consider some special cases of the restricted assignment problem.  ...  We give an LP-formulation for the problem with two job sizes and show that it has an integral optimal solution. We also present a PTAS for the case that the M j 's are intervals of the same length.  ...  Intervals and two processing times We assume here that an instance only consists of small jobs with processing time p j = s and big jobs with processing time p j = b s.  ... 
doi:10.1016/j.ipl.2016.06.007 fatcat:lwg2fmewvnghdm2xzrv4ol53ja

Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods [chapter]

Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, Andreas Wiese
2010 Lecture Notes in Computer Science  
By exploiting structural insights of the problem we obtain an IP-formulation and primal heuristics that together solve the real-world instances to optimality and outperform text-book approaches by several  ...  We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft.  ...  Moreover, for a subset of tasks, a predefined assignment of tasks to machines is already given as part of the input.  ... 
doi:10.1007/978-3-642-15775-2_2 fatcat:pw3xouqdmrhrfjs457u7rxhqky

Hypothetical inference and category structure

Deborah Redding-Stewart, Russell Revlin
1978 Bulletin of the Psychonomic Society  
The findings accord with a two-stage process derived from a generality coding model.  ...  The statements varied in degree of structure along two dimensions: across categories organization (generality) and within-categories organization (typicality).  ...  The low-typicality members of a category were chosen from the Battig and Montague (1969) norms with the restriction that the frequency with which subjects selected an instance first be no less than 10  ... 
doi:10.3758/bf03329738 fatcat:yrdwslqjqjb23cumdvt2byvtv4

A Machine Learning Approach to Workflow Management [chapter]

Joachim Herbst
2000 Lecture Notes in Computer Science  
Two split operators are available for specialization.  ...  This contribution shows how the basic principle of our previous approach to sequential workflow induction can be generalized, so that it is able to deal with concurrency.  ...  We have decomposed the induction task into two subtasks: -Induction of structure -within this subtask the nodes, the edges, the activity assignment function and the transition probabilities of M are induced  ... 
doi:10.1007/3-540-45164-1_19 fatcat:fqp3yvk3sve47dfx5l5ece2q6q

Polynomial restrictions of SAT: What can be done with an efficient implementation of the Davis and Putnam's procedure? [chapter]

Antoine Rauzy
1995 Lecture Notes in Computer Science  
Two approaches have been used to tackle this intractability: the improvement of general purpose solvers and the research of polynomial time restrictions.  ...  In this paper, we examplify this problem by studying both theoretical and practical complexities of the Davis and Putnam's procedure on the two main polynomial restrictions of SAT, namely Horn-SAT and  ...  A clause may change at most two times of status during the propagation process (from unchanged to shortened then from shortened to falsified or to satisfied), thus its literals are visited at most two  ... 
doi:10.1007/3-540-60299-2_31 fatcat:yl2b4oqyefa63ek2elq55d5voa

The RALph miner for automated discovery and verification of resource-aware process models

Cristina Cabanillas, Lars Ackermann, Stefan Schönig, Christian Sturm, Jan Mendling
2020 Journal of Software and Systems Modeling  
Such constraints can be complex and process discovery approaches so far have missed the opportunity to represent expressive resource assignments graphically together with process models.  ...  A subsequent verification of the extracted resource-aware process models is required in order to check the proper utilisation of resources according to the resource assignments.  ...  of time to avoid process deadlocks.  ... 
doi:10.1007/s10270-020-00820-7 fatcat:qcp5pjebfnfk3hzxbzhvc7vcjy

SHARE-ODS: An Ontology Data Service for Search and Rescue Operations [chapter]

Stasinos Konstantopoulos, Georgios Paliouras, Symeon Chatzinotas
2006 Lecture Notes in Computer Science  
Furthermore, the ontology supports the semantic indexing of multimedia documents in the context of SaR processes and activities.  ...  The ontological model represents various aspects of the command, communication, and organisational structure of the SaR forces and the deployment and progress of a SaR operation.  ...  Events relate a temporal instance with some other characteristic or instance of the operation. For example, a Manpower Report Event instance relates a Time Point with the manpower at that time.  ... 
doi:10.1007/11752912_60 fatcat:avac4xkjhjd7rlt3vnpda5kona

Approaches to modeling train scheduling problems as job-shop problems with blocking constraints

Julia Lange, Frank Werner
2017 Journal of Scheduling  
A computational study is made on hard instances with up to 20 jobs and 11 machines to compare the MIP models in terms of total tardiness values, formulation size and computation time.  ...  Four MIP formulations without time-indexed variables are developed based on two dierent transformation approaches of parallel tracks and two dierent types of decision variables leading to job-shop scheduling  ...  The instances with 15 jobs are solved in less dense structures by increasing the allowance factor to a = 1.5 and the upper bound of the release time interval to four times (r = 4) the minimum total processing  ... 
doi:10.1007/s10951-017-0526-0 fatcat:zlf2t33iubfvnhz27jcgsefjeu

A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem [chapter]

Christoforos Charalambous, Krzysztof Fleszar, Khalil S. Hindi
2010 IFIP Advances in Information and Communication Technology  
and mathematical programming for the definition and exploration of neighborhood structures.  ...  The work addresses the NP-hard problem of scheduling a set of jobs to unrelated parallel machines with the overall objective of minimizing makespan.  ...  The machines are unrelated in that the processing time of a job depends on the machine to which it is assigned.  ... 
doi:10.1007/978-3-642-16239-8_31 fatcat:cfflrktigvaxlg7wel73rrx7ya

The Surplus Inventory Matching Problem in the Process Industry

Jayant R. Kalagnanam, Milind W. Dawande, Mark Trumbo, Ho Soo Lee
2000 Operations Research  
In this paper, we formulate this problem, provide a result regarding its complexity and report on our computational experience with solving a set of real instances based on data from the operations of  ...  called \color" in the paper) to an item and then adding the associated \color" constraints which restrict the number of distinct colors which can be assigned to a knapsack and (iii) considering multiple  ...  The problem that we have outlined so far with the two restrictions above presents another instance with a sparse staircase structure.  ... 
doi:10.1287/opre.48.4.505.12425 fatcat:jyg2il2wvna5vbn7xpaw2zzd2u

A Model-Based Executive for Commanding Robot Teams [chapter]

Anthony Barrett
2006 Lecture Notes in Computer Science  
Instead of modeling each component system in isolation and then manually crafting interaction protocols, this approach starts with a model of the collective population as a single system.  ...  The paper presents a way to robustly command a system of systems as a single entity.  ...  Acknowledgements This work was performed at the Jet Propulsion Laboratory, California Institute of Technology, under a contract with the National Aeronautics and Space Administration.  ... 
doi:10.1007/11678823_10 fatcat:ita7afg5e5bhhgudxqm4cc4dlm
« Previous Showing results 1 — 15 out of 605,998 results