The just-in-time scheduling problem in a flow-shop scheduling system (Q421784): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.053 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047909764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval scheduling on identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-coloring of intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the weighted number of just-in-time jobs in flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing maximum completion time in a proportionate flow shop with one machine of different speed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proportionate flow shop games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chain and antichain families of a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed interval scheduling: models, applications, computational complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize the number of early and tardy jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit processing time jobs on an <i>m</i>-machine flow-shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on flow-shop and job-shop batch scheduling with identical processing-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open-shop batch scheduling with identical jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax earliness-tardiness costs with unit processing time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight<i>k</i>-independent set problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(k\)-covering of weighted transitive graphs with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted completion time in a proportionate flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Independent Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the largest suborder of fixed width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing weighted number of just-in-time jobs on unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:53, 5 July 2024

scientific article
Language Label Description Also known as
English
The just-in-time scheduling problem in a flow-shop scheduling system
scientific article

    Statements

    The just-in-time scheduling problem in a flow-shop scheduling system (English)
    0 references
    0 references
    14 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    just-in-time scheduling
    0 references
    flow-shop
    0 references
    complexity
    0 references
    pseudo-polynomial time algorithm
    0 references
    no-wait restriction
    0 references
    0 references