Open AccessBook
Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop
Reads0
Chats0
TLDR
In this article, an introduction to the mathematics of the job shop is presented, with a focus on the sequential and scheduling aspects of the system. But this approach is not suitable for all job-shop scenarios.Abstract:
(1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Journal of the Operational Research Society: Vol. 33, No. 9, pp. 862-862.read more
Citations
More filters
Book ChapterDOI
Gray coding in evolutionary multicriteria optimization: application in frame structural optimum design
TL;DR: Results in a 55 bar-sized frame test case show that the use of the Standard Binary Reflected Gray code compared versus Binary code allows to obtain fast and more accurate solutions, more coverage of non-dominated fronts; both with improved robustness in frame structural multiobjective optimum design.
Journal ArticleDOI
Several variants of simulated annealing hyper-heuristic for a single-machine scheduling with two-scenario-based dependent processing times
Chin-Chia Wu,Danyu Bai,Juin-Han Chen,Win-Chin Lin,Lining Xing,Jia-Cheng Lin,Shuenn-Ren Cheng +6 more
TL;DR: This work investigates a single-machine problem with two-scenario-based processing times, where the goal is to minimize the maximum total completion times over two scenarios, and proposes seven low level heuristics to solve this problem.
Journal ArticleDOI
Heuristics for scheduling in flowshops and flowline-based manufacturing cells to minimize the sum of weighted flowtime and weighted tardiness of jobs
TL;DR: In this article, the problem of scheduling in two different types of flowshops (all jobs available at time zero, different job availability times known a priori) and in flowline-based manufacturing cells is considered with the objective of minimizing the sum of weighted flowtime and weighted tardiness of jobs.
Proceedings Article
Building state-of-the-art sat solvers
Inês Lynce,Joao Marques-Silva +1 more
TL;DR: The search techniques that have been proposed in recent years for backtrack search SAT solvers are described and empirically evaluated, using representative real-world problem instances to address the problem of organizing effective DPLL-based SATsolvers.