Results 291 to 300 of about 122,671 (350)
Multicriteria scheduling of two-subassembly products with batch availability and precedence constraints. [PDF]
PeerJ Comput SciWen Z, Li S.
europepmc +1 more source
Dynamic Intelligent Scheduling in Low-Carbon Heterogeneous Distributed Flexible Job Shops with Job Insertions and Transfers. [PDF]
Sensors (Basel)Chen Y, Liao X, Chen G, Hou Y.
europepmc +1 more source
Centralized scheduling, decentralized scheduling or demand scheduling? How to more effectively allocate and recycle shared takeout lunch boxes. [PDF]
PLoS OneBai Y, Liu D, Ma J.
europepmc +1 more source
, 1996 In this chapter we are going to consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of jobs, each of which is characterized by its own machine sequence. We will assume that any two consecutive tasks of the same job are to be processed on different machines. The type of factory layout is the job shop.
Jan Węglarz +4 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Job Shop Scheduling With Deadlines
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BALAS E. +3 more
openaire +4 more sources
Scheduling the General Job-Shop
Management Science, 1985A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.
Jeffrey R. Barker, Graham B. McMahon
openaire +2 more sources
1997
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Edwin Hou, Nirwan Ansari
openaire +4 more sources
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Edwin Hou, Nirwan Ansari
openaire +4 more sources
Scheduling job shops with uncertainties [PDF]
Proceedings of the 36th IEEE Conference on Decision and Control, 2002 Effective management of production uncertainties is becoming critical in the era of "time-based competition". The consideration of uncertainties, however, is difficult because of the combinatorial nature of the problem as well as the probabilistic nature of uncertain factors.
Feng Liu, Dong Chen, Peter B. Luh
openaire +1 more source
Annals of Operations Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +6 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +6 more sources
Scheduling job shops with delays
Proceedings. 1987 IEEE International Conference on Robotics and Automation, 1991In this paper, the presence of delay in a job shop is addressed. We show that delay is an important consideration in many manufacturing systems that are modeled as continuous flow processes. A scheduling policy for a job shop with delays is then derived using theoretical arguments and heuristics.
Stanley B. Gershwin +2 more
openaire +3 more sources