A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
Admissible Search Methods for Minimum Penalty Sequencing of Jobs with Setup Times on One and Two Machines
1991
International Joint Conference on Artificial Intelligence
Preserved Fulltext
that involve the proper sequencing of jobs in one-machine job-shops and two-machine flow-shops. ...
The problems studied here have the following general form: The completion of a job at time f induces a penalty G(f), where G(.) is a given penalty function which can be different for different jobs; the ...
As for two-machine flowshop situations, work has been confined to the determination of minimum length follows job J i in the sequence, the total setup time (q i + P j ) can be viewed as corresponding ...
dblp:conf/ijcai/SenBS91
fatcat:d23rdwb4r5ge5ov2olxngoss4a
Graph search methods for non-order-preserving evaluation functions: applications to job sequencing problems
1996
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Such situations arise in one-machine minimum penalty job sequencing problems when setup times are sequence dependent. ...
At the same time, it is as efficient as A* in solving graph search problems with order-preserving evaluation functions. ...
The quadratic penalty version of the one-machine minimum penalty job sequencing problem with sequencedependent setup times has great practical interest. ...
doi:10.1016/0004-3702(95)00094-1
fatcat:oh2b4h6h7nb35ke5j53vnkdyie
Optimal Factory Scheduling using Stochastic Dominance A*
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We examine a standard factory scheduling problem with stochastic processing and setup times, minimizing the expectation of the weighted number of tardy jobs. ...
, with comparable search effort. ...
Acknowledgements We are gratefu l to the anonymous reviewers and stu dents in the U-M Decision Machines Group for sug gestions about the presentation of this work. ...
arXiv:1302.3611v1
fatcat:nqob627czvgpvm35imnbo6nepm
Heuristic Method for Decision-Making in Common Scheduling Problems
2017
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The paper includes applications of the presented approach to scheduling problems on unrelated parallel machines with a deadline and machine setup time dependent on the process state, where the relationship ...
The aim of the paper is to present a heuristic method for decision-making regarding an NP-hard scheduling problem with limitations related to tasks and the resources dependent on the current state of the ...
Moreover, I would like to thank all anonymous referees for careful reading the original manuscript and for providing detailed comments and suggestions for improvements. ...
doi:10.3390/app7101073
fatcat:d74yvoqlirg4fgwqy72gfxjf6a
Average-case analysis of best-first search in two representative directed acyclic graphs
2004
Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The first domain relates to one-machine job sequencing problems in which a set of jobs must be sequenced on a machine in such a way that a penalty function is minimized. ...
We take two problem domains for which the search graphs are directed acyclic graphs of similar structure, and determine the average case performance of the best-first search algorithm A * on these graphs ...
Thanks to the anonymous reviewers for constructive comments. ...
doi:10.1016/j.artint.2004.01.001
fatcat:k3qqduilq5dp3fwgznig6jvndu
A Generic Decision Support Tool to Planning and Assignment Problems: Industrial Application & Industry 4.0
2017
Procedia Manufacturing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
account the setup time for plastic injection, and a scheduling problem with precedence constraints. ...
Several tactical and operational problems have been solved with our tool: a problem of planning activities with resources assignment for hospital systems, a lot-sizing and scheduling problem taking into ...
Each operation has a processing time and there is a setup time between the processing of two consecutive operations which is sequence dependent. Each job has a requested period. ...
doi:10.1016/j.promfg.2017.07.293
fatcat:aha7nfe3orgbvoovee5asrp75i
TECHNIQUES AND APPLICATIONS OF PRODUCTION PLANNING IN ELECTRONICS MANUFACTURING SYSTEMS
[chapter]
2003
Computer Aided and Integrated Manufacturing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
In Section 4 we review existing commercial applications for production planning, and in Section 5 study more closely one of these systems. ...
Our intention is to identify the typical problems arising from production planning and to give a survey of the solution methods suggested in the literature. ...
Next, the method determines the group with the least slack time, and calculates penalties for each job in that group. ...
doi:10.1142/9789812796813_0001
fatcat:ddkdmju5gna5rpsdjnvdyahvam
An annotated bibliography of GRASP-Part II: Applications
2009
International Transactions in Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This is the second of two papers with an annotated bibliography of the GRASP literature from 1989 to 2008. In the companion paper, algorithmic aspects of GRASP are surveyed. ...
It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local ...
A GRASP for single machine scheduling with sequence dependent setup costs and linear delay penalties is presented. ...
doi:10.1111/j.1475-3995.2009.00664.x
fatcat:wdqwc6xvcnfq3fi5ujy6jy5wtm
Sequence-dependent scheduling with order deliveries
2013
Applied Mathematics and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A set of jobs is to be processed on a single machine and each job belongs to a specific group. The completion time of a group is the moment when all jobs belonging to this group are completed. ...
The problem is to determine a processing sequence of the jobs such that the sum of weighted completion times over all groups is minimized. ...
Acknowledgements The authors are grateful for the reviewers' comments that have improved the presentation of earlier versions of this paper. ...
doi:10.1016/j.amc.2013.06.087
fatcat:tmbe5kbdtbbf3pot62lbllzs4y
JOINT OPTIMIZATION OF PRODUCTION PLANNING AND VEHICLE ROUTING PROBLEMS: A REVIEW OF EXISTING STRATEGIES
2014
Pesquisa Operacional
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
for future research. ...
On the production side we will distinguish between tactical models of lot-sizing or capacity allocation and operational models of production scheduling. ...
Tavares Neto thanks FAPESP/Brazil for its financial support (process 2011/14800-3). ...
doi:10.1590/0101-7438.2014.034.02.0189
fatcat:soscqxrdwvb45e2ndla62kji5q
Scheduling in production, supply chain and Industry 4.0 systems by optimal control: fundamentals, state-of-the-art and applications
2018
International Journal of Production Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
, and machine setups require further investigation and the application of a broad range of methodical approaches. ...
We consider optimal control models, performance analysis qualitative methods, and computational methods for optimal control. ...
is bounded (Eq. 18) 1 1 kj kj kj T t u T ) ( , (18) where kj T is the minimum time of setting up machine k on state j , and kj T is the minimum time of setting down machine k on state j . ...
doi:10.1080/00207543.2018.1442948
fatcat:mjpt2ev2a5fpjmfpnd7yw3nxqi
Interaction of the Decision Maker in the Process of Production Scheduling
2014
Advanced Materials Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The purpose of this work is to present a range of knowledge and information which should have a decision maker and also the advantages and disadvantages of each method of participation. ...
The work in this area is one of the most important steps when designing a new, dedicated scheduling system as well as during the analysis, selection and adaptation of an external one. ...
The comparison with single-criterion version of this approach was also discussed. [12] proposes an approach for scheduling a continuous stream of batch jobs on the machines of a computational grid. ...
doi:10.4028/www.scientific.net/amr.1036.830
fatcat:7niqbnrmnnam7ef66lli3on7dq
Grasp: An Annotated Bibliography
[chapter]
2002
Operations Research/Computer Science Interfaces Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local ...
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. ...
The purpose of this paper is to provide a method for minimizing the sum of tool setup and volume removal times associated with metal cutting operations on a flexible machine. ...
doi:10.1007/978-1-4615-1507-4_15
fatcat:kvaokik4m5a2bezgzzcfaqjbui
Improving Just-in-Time Delivery Performance of IoT-Enabled Flexible Manufacturing Systems with AGV Based Material Transportation
2020
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The performance of the proposed system is tested on the Integrated Manufacturing and Logistics (IML) demonstrator at WMG, University of Warwick. ...
Autonomous guided vehicles (AGVs) are driverless material handling systems used for transportation of pallets and line side supply of materials to provide flexibility and agility in shop-floor logistics ...
The strategy is based on a hybrid heuristic search method, called any-time layered search (ALS), optimising the AGV schedules based on both the makespan and the exit time of the last job of the system. ...
doi:10.3390/s20216333
pmid:33171979
fatcat:usqyt42grremjeutedbgmxipxi
Single and Multi-objective Evolutionary Algorithms for the Coordination of Serial Manufacturing Operations
2006
Journal of Intelligent Manufacturing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
All the considered algorithms are able to find satisfactory solutions on large production sequences with nearly 300 jobs in acceptable computation times, but they also exhibit some complementary characteristics ...
Two algorithms are designed to perform directed search by aggregating the objectives of each department in a single fitness, while a third one is designed to search for the Pareto front of non-dominated ...
possible permutations of the job sequence is an admissible solution to our problem. ...
doi:10.1007/s10845-005-6641-3
fatcat:lhadvcoulfbqvcuofd54amz5jy
« Previous
Showing results 1 — 15 out of 820 results