scispace - formally typeset
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

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

A Genetic Algorithm with a Quasi-local Search for the Job Shop Problem with Recirculation

TL;DR: A polyalphaolefin extended polyurethane system comprising the reaction product of an isocyanate terminated polyisocyanates with a polyol in the presence of a polyalphaolfin and, optionally, a liquid ester coupling agent is proposed.
Journal ArticleDOI

Intelligent Scheduling with Reinforcement Learning

TL;DR: The main contribution of this work is proving that reinforcement learning has the potential to become the standard method whenever a solution is necessary quickly, since it solves any problem in very few seconds with high quality, approximate to the optimal methods.
Journal ArticleDOI

A branch and bound algorithm for the two-machine flowshop problem with unit-time operations and time delays

TL;DR: This paper considers the problem of scheduling, on a two-machine flowshop, a set of unit-time operations subject to time delays with respect to the makespan, and proposes an algorithm based on a branch and bound enumeration scheme.

Genetic Algorithm for Job Shop Scheduling Problem: A Case Study

TL;DR: Genetic algorithm (GA) with some modifications to deal with problem of job shop scheduling is used and the result is compared with dispatching rules such as longest processing time, shortest processing time and first come first serve.
Proceedings ArticleDOI

Applying the adaptive Hybrid Flow-Shop scheduling method to schedule a 3GPP LTE physical layer algorithm onto many-core digital signal processors

TL;DR: HFS scheduling is applied to the scheduling of 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) telecommunication standard Uplink Physical Layer data processing (PUSCH) and shows that an HFS scheduling algorithm has an overhead that increases very slowly with the number of PEs.