Just-in-time scheduling with controllable processing times on parallel machines
type: Item
instance of: scholarly article
title: Just-in-time scheduling with controllable processing times on parallel machines
zbMATH Open document ID: 1188.90100
author: Yaron Leyvand
author: Dvir Shabtay
author: George Steiner
author: Liron Yedidsion
published in: Journal of Combinatorial Optimization
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 5719882
zbMATH Keywords: just-in-time scheduling
zbMATH Keywords: fixed interval scheduling
zbMATH Keywords: unrelated parallel machines
zbMATH Keywords: controllable processing times
zbMATH Keywords: resource allocation
MaRDI profile type: Publication
full work available at URL: s10878-009-9270-5
OpenAlex ID: W1976269048
cites work: Two parallel machine sequencing problems involving controllable job processing times
cites work: Scheduling jobs with fixed start and end times
cites work: Cost-effectiveness of a preventive counseling and support package for postnatal depression
cites work: Solving a class of two-resource allocation problem by equivalent load method
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Interval scheduling on identical machines
cites work: On the \(k\)-coloring of intervals
cites work: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
cites work: A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines
cites work: On chain and antichain families of a partially ordered set
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
cites work: Some comments on sequencing with controllable processing times
cites work: An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
cites work: Q3775317
cites work: General flow-shop scheduling with resource constraints
cites work: Minimization of the makespan in a two-machine problem under given resource constraints
cites work: Resource Management in Machine Scheduling Problems: A Survey
cites work: Single machine scheduling subject to deadlines and resource dependent processing times
cites work: Positive half-products and scheduling with controllable processing times
cites work: Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
cites work: Job-shop scheduling with convex models of operations
cites work: Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies
cites work: A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
cites work: Fixed interval scheduling: models, applications, computational complexity and algorithms
cites work: Single machine scheduling to minimize the number of early and tardy jobs
cites work: Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
cites work: Group scheduling with controllable setup and processing times: minimizing total weighted completion time
cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
cites work: A survey of results for sequencing problems with controllable processing times
cites work: A sequential algorithm for finding a maximum weightK-independent set on interval graphs
cites work: Maximum weightk-independent set problem on permutation graphs
cites work: Algorithms for Scheduling Independent Tasks
cites work: Maximum \(k\)-covering of weighted transitive graphs with applications
cites work: Allocation of resources in project management
cites work: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
cites work: Minimizing the total weighted flow time in a single machine with controllable processing times
cites work: A survey of scheduling with controllable processing times
cites work: Pre-emptive scheduling problems with controllable processing times
cites work: Single machine scheduling with controllable release and processing parameters
cites work: Finding the largest suborder of fixed width
cites work: Maximizing weighted number of just-in-time jobs on unrelated parallel machines
cites work: Scheduling Multiple Variable-Speed Machines
cites work: A bicriterion approach to time/cost trade-offs in sequencing
cites work: The maximum k-colorable subgraph problem for chordal graphs
cites work: A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
DOI: 10.1007/S10878-009-9270-5
description: scientific article; zbMATH DE number 5719882