Results 331 to 340 of about 199,857 (394)
Some of the next articles are maybe not open access.
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.
Jacek Błażewicz +4 more
openaire +1 more source
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.
Jacek Błażewicz +4 more
openaire +1 more source
The flexible job shop scheduling problem: A review
European Journal of Operational Research, 2023S. Dauzére-Pérés +3 more
semanticscholar +1 more source
Job-Shop Scheduling by Implicit Enumeration
Management Science, 1977The classical combinatorial optimization problem of minimizing maximum completion time in a general job-shop has been the subject of extensive research. In this paper we review and extend this work. A general bounding approach is developed which includes all previously presented lower bounds as special cases. The strongest bound obtainable in this way
B. J. Lageweg +2 more
openaire +1 more source
Digital-Twin-Based Job Shop Scheduling Toward Smart Manufacturing
IEEE Transactions on Industrial Informatics, 2019Job shop scheduling always plays an important role in the manufacturing process and is one of the decisive factors influencing manufacturing efficiency.
Yilin Fang +5 more
semanticscholar +1 more source
Annals of Operations Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Research on flexible job shop scheduling problem with AGV using double DQN
Journal of Intelligent Manufacturing, 2023Minghai Yuan +5 more
semanticscholar +1 more source
Lot Streaming in Job-Shop Scheduling
Operations Research, 1997The issue in Lot Streaming is how to split lots into sublots in order to improve the makespan (or some other criterion). We present a model and an iterative procedure for a general job-shop environment. The procedure alternates between solving a lot-sizing problem with a given sequence of sublots on the machines, and a standard job-shop scheduling ...
Dauzère-Pérès, Stéphane +1 more
openaire +1 more source
IEEE Transactions on Cybernetics, 2019
Flexible job shop scheduling problem (FJSP) has been extensively considered; however, multiobjective FJSP with energy consumption threshold is seldom investigated, the goal of which is to minimize makespan and total tardiness under the constraint that ...
Deming Lei, Ming Li, Ling Wang
semanticscholar +1 more source
Flexible job shop scheduling problem (FJSP) has been extensively considered; however, multiobjective FJSP with energy consumption threshold is seldom investigated, the goal of which is to minimize makespan and total tardiness under the constraint that ...
Deming Lei, Ming Li, Ling Wang
semanticscholar +1 more source
Job-shop scheduling using neural networks
Control Engineering Practice, 1993Abstract Job-shop scheduling cannot casually be accomplished analytically, so, it is done by computer Simulation using heuristic priority rules. The SLACK rule for calculating the margins of jobs to then due-dates is effective in meeting the due-dates.
T. Watanabe, H. Tokumaru, Y. Hashimoto
openaire +1 more source
2016
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +1 more source
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +1 more source