Just-in-time scheduling with controllable processing times on parallel machines
From MaRDI portal
Publication:975765
DOI10.1007/s10878-009-9270-5zbMath1188.90100OpenAlexW1976269048MaRDI QIDQ975765
Yaron Leyvand, Liron Yedidsion, Dvir Shabtay, George Steiner
Publication date: 11 June 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9270-5
resource allocationunrelated parallel machinescontrollable processing timesfixed interval schedulingjust-in-time scheduling
Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (9)
Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times ⋮ Batch scheduling of identical jobs with controllable processing times ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ Single machine resource allocation scheduling problems with deterioration effect and general positional effect ⋮ An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach ⋮ Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Models and algorithms for energy-efficient scheduling with immediate start of jobs
Cites Work
- Unnamed Item
- Finding the largest suborder of fixed width
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Pre-emptive scheduling problems with controllable processing times
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- A survey of results for sequencing problems with controllable processing times
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- Scheduling jobs with fixed start and end times
- The maximum k-colorable subgraph problem for chordal graphs
- On chain and antichain families of a partially ordered set
- A bicriterion approach to time/cost trade-offs in sequencing
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Maximum \(k\)-covering of weighted transitive graphs with applications
- Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
- Single machine scheduling subject to deadlines and resource dependent processing times
- Minimization of the makespan in a two-machine problem under given resource constraints
- Two parallel machine sequencing problems involving controllable job processing times
- Job-shop scheduling with convex models of operations
- Some comments on sequencing with controllable processing times
- Positive half-products and scheduling with controllable processing times
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Minimizing the total weighted flow time in a single machine with controllable processing times
- On the \(k\)-coloring of intervals
- Single machine scheduling to minimize the number of early and tardy jobs
- A survey of scheduling with controllable processing times
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- Single machine scheduling with controllable release and processing parameters
- Interval scheduling on identical machines
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- Resource Management in Machine Scheduling Problems: A Survey
- Sequencing with Earliness and Tardiness Penalties: A Review
- General flow-shop scheduling with resource constraints
- Algorithms for Scheduling Independent Tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Multiple Variable-Speed Machines
- Solving a class of two-resource allocation problem by equivalent load method
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Maximum weightk-independent set problem on permutation graphs
- Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies
- Allocation of resources in project management
- Cost-effectiveness of a preventive counseling and support package for postnatal depression
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
This page was built for publication: Just-in-time scheduling with controllable processing times on parallel machines
