Just-in-time scheduling with controllable processing times on parallel machines
DOI10.1007/S10878-009-9270-5zbMATH Open1188.90100OpenAlexW1976269048MaRDI QIDQ975765FDOQ975765
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 allocationcontrollable processing timesunrelated parallel machinesfixed interval schedulingjust-in-time scheduling
Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Title not available (Why is that?)
- Some comments on sequencing with controllable processing times
- Positive half-products and scheduling with controllable processing times
- A survey of scheduling with controllable processing times
- Single machine scheduling with controllable release and processing parameters
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
- A survey of results for sequencing problems with controllable processing times
- Scheduling jobs with fixed start and end times
- On the \(k\)-coloring of intervals
- Algorithms for Scheduling Independent Tasks
- Allocation of resources in project management
- The maximum k-colorable subgraph problem for chordal graphs
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Maximum \(k\)-covering of weighted transitive graphs with applications
- On chain and antichain families of a partially ordered set
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- Sequencing with Earliness and Tardiness Penalties: A Review
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A bicriterion approach to time/cost trade-offs in sequencing
- Single machine scheduling subject to deadlines and resource dependent processing times
- Two parallel machine sequencing problems involving controllable job processing times
- Interval scheduling on identical machines
- Pre-emptive scheduling problems with controllable processing times
- Single machine scheduling to minimize the number of early and tardy jobs
- A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
- Scheduling Multiple Variable-Speed Machines
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
- Maximum weightk-independent set problem on permutation graphs
- Finding the largest suborder of fixed width
- Minimizing the total weighted flow time in a single machine with controllable processing times
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- 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
- Solving a class of two-resource allocation problem by equivalent load method
- Cost-effectiveness of a preventive counseling and support package for postnatal depression
- Minimization of the makespan in a two-machine problem under given resource constraints
- General flow-shop scheduling with resource constraints
- Resource Management in Machine Scheduling Problems: A Survey
- Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
- Job-shop scheduling with convex models of operations
- Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies
Cited In (12)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- On the parameterized complexity of interval scheduling with eligible machine sets
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- Batch scheduling of identical jobs with controllable processing times
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
- Title not available (Why is that?)
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- Single machine resource allocation scheduling problems with deterioration effect and general positional effect
- Models and algorithms for energy-efficient scheduling with immediate start of jobs
This page was built for publication: Just-in-time scheduling with controllable processing times on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975765)