Results 291 to 300 of about 193,237 (350)

Job-Shop Sequencing and Scheduling [PDF]

, 1994
In the framework of the integrated model introduced in Chapter III, we are first interested in finding an optimal schedule in a job-shop. This difficult problem has been largely discussed in the literature for more than 20 years (see [Balas 69], [Mc Mahon et Florian 75], [Baker 87], [Carlier 78], [Lageweg et ai 77], [Barker and Mc Mahon 85] or [Carlier
Jean B. Lasserre, Stéphane Dauzère-Péres   +1 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Knowledge-Based Reinforcement Learning and Estimation of Distribution Algorithm for Flexible Job Shop Scheduling Problem

IEEE Transactions on Emerging Topics in Computational Intelligence, 2023
Yu Du, Jun-qing Li, Xiaolong Chen, Pei-yong Duan, Q. Pan   +4 more
semanticscholar   +1 more source

A Two-Phase Meta-Heuristic for Multiobjective Flexible Job Shop Scheduling Problem With Total Energy Consumption Threshold

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

The flexible job shop scheduling problem: A review

European Journal of Operational Research, 2023
S. Dauzére-Pérés, J. Ding, Liji Shen, Karim Tamssaouet   +3 more
semanticscholar   +1 more source

Review on flexible job shop scheduling

IET Collaborative Intelligent Manufacturing, 2019
Flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimisation problem, which has significant applications in the real world. Due to its complexity and significance, lots of attentions have been paid to tackle this problem.
J. Xie, Liang Gao, Kunkun Peng, Xinyu Li, Haoran Li   +4 more
semanticscholar   +1 more source

Heuristics in Job Shop Scheduling

Management Science, 1966
The problem is that of scheduling jobs with diverse routings on the productive facilities in a shop such that the respective due dates are met, or failing this, the sum of lateness times is minimized. The approach is simulative in that the operation of the shop is simulated in a Fortran program, but in addition to the straightforward use of priority ...
openaire   +2 more sources

Lot Streaming in Job-Shop Scheduling

Operations Research, 1997
The 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 ...
Stéphane Dauzère-Pérès, Jean B. Lasserre   +1 more
openaire   +2 more sources

Digital-Twin-Based Job Shop Scheduling Toward Smart Manufacturing

IEEE Transactions on Industrial Informatics, 2019
Job shop scheduling always plays an important role in the manufacturing process and is one of the decisive factors influencing manufacturing efficiency.
Yilin Fang, Chao Peng, P. Lou, Zude Zhou, Jianmin Hu, Junwei Yan   +5 more
semanticscholar   +1 more source

Machine Scheduling and Job Shop Scheduling [PDF]

, 2009
This chapter focuses on job shops. There are n jobs and each job visits a number of machines following a predetermined route. In some models a job may visit any given machine at most once and in other models a job may visit each machine more than once. In the latter case it is said that the job shop is subject to recirculation.
openaire   +1 more source

A Review of Job Shop Scheduling

Journal of the Operational Research Society, 1966
This paper discusses the more recent literature on job-shop-like sequencing problems.The types of problems can be broadly classified as "due date" or "minimum make-span" and among the solutions des...
openaire   +2 more sources