Just-in-time scheduling with controllable processing times on parallel machines (Q975765): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10878-009-9270-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976269048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two parallel machine sequencing problems involving controllable job processing times / 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: Cost-effectiveness of a preventive counseling and support package for postnatal depression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of two-resource allocation problem by equivalent load method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / 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: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times / 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: 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: Some comments on sequencing with controllable processing times / 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: Q3775317 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General flow-shop scheduling with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of the makespan in a two-machine problem under given resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Management in Machine Scheduling Problems: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling subject to deadlines and resource dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive half-products and scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with convex models of operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bounding mechanism for the CNC machine scheduling problems with controllable processing times / 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: Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group scheduling with controllable setup and processing times: minimizing total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of results for sequencing problems with controllable processing times / 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: Algorithms for Scheduling Independent Tasks / 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: Allocation of resources in project management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total weighted flow time in a single machine with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pre-emptive scheduling problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with controllable release and processing parameters / 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: Scheduling Multiple Variable-Speed Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to time/cost trade-offs in sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine / rank
 
Normal rank

Latest revision as of 22:31, 2 July 2024

scientific article
Language Label Description Also known as
English
Just-in-time scheduling with controllable processing times on parallel machines
scientific article

    Statements

    Just-in-time scheduling with controllable processing times on parallel machines (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 June 2010
    0 references
    just-in-time scheduling
    0 references
    fixed interval scheduling
    0 references
    unrelated parallel machines
    0 references
    controllable processing times
    0 references
    resource allocation
    0 references
    0 references

    Identifiers