Selecting inversions in a chord progression with the triad by a lexicographic bi-criteria optimization
We are given a sequence of m machines and an ordered set of n jobs. The n jobs are served by the m-machine system in their indexing order. We are also given a collection of pj machine subsets for each job j ∈ N, where N denotes the set of jobs. We are primarily asked to choose a machine subset from...
Main Authors: | Yoshiyuki KARUNO, Ryota YOSHII |
---|---|
Format: | Article |
Language: | English |
Published: |
The Japan Society of Mechanical Engineers
2020-07-01
|
Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
Subjects: | |
Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/14/5/14_2020jamdsm0068/_pdf/-char/en |
Similar Items
-
Indexing the etymological lexicographic systems
by: Volodymyr Shyrokov, et al.
Published: (2014-09-01) -
The Lp chord Minkowski problem
by: Xi Dongmeng, et al.
Published: (2023-01-01) -
Transformer-Based Seq2Seq Model for Chord Progression Generation
by: Shuyu Li, et al.
Published: (2023-02-01) -
Ontologized Lexicographical Systems in Modern Terminography
by: Volodymyr Shyrokov, et al.
Published: (2016-12-01) -
Pairs Of Edges As Chords And As Cut-Edges
by: McKee Terry A.
Published: (2014-11-01)