logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Characterisation by decomposition in scheduling

delete1998-04-01
delete0
PRE
AI
P
Pierre Lòpez *
M
Marie-Luce Levy
B
B. Pradin
DOI：10.1016/S0166-3615(97)00104-8delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, the authors pose the principles of a temporal decomposition method for the single machine scheduling problem. A set of feasible schedules is characterised by means of constraint-based analysis rules. These rules permit the determination of the feasible locations of each activity in a sequence, represented by the rank interval. The temporal properties pointed out serve to support the decision-making in large-scale problems and generate an interesting solution more rapidly. (C) 1998 Elsevier Science B.V. All rights reserved.
Keywords:
scheduling
decomposition
feasibility
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Computers in Industry cover
Computers in Industry
IF:
9.1
Papers:
2.9K
Citations:
1.1W

Organization

No organization information available