Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A survey of scheduling with controllable processing times - MaRDI portal

A survey of scheduling with controllable processing times (Q2381529)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A survey of scheduling with controllable processing times	scientific article

Statements

scholarly article

0 references

A survey of scheduling with controllable processing times (English)

0 references

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

18 September 2007

0 references

zbMATH Keywords

deterministic scheduling

0 references

controllable processing times

0 references

resource allocation

0 references

complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2007.02.003

0 references

Two parallel machine sequencing problems involving controllable job processing times

0 references

Cost-effectiveness of a preventive counseling and support package for postnatal depression

0 references

Solving a class of two-resource allocation problem by equivalent load method

0 references

Minimization of Half-Products

0 references

Simultaneous job scheduling and resource allocation on parallel machines

0 references

Single machine scheduling with discretely controllable processing times

0 references

0 references

Single-machine scheduling with trade-off between number of tardy jobs and resource allocation

0 references

Scheduling to minimize the total compression and late costs

0 references

A permutation flow-shop scheduling problem with convex models of operation processing times

0 references

Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

0 references

Single machine batch scheduling with resource dependent setup and processing times

0 references

Single machine batch scheduling with deadlines and resource dependent processing times

0 references

Scheduling with controllable release dates and processing times: Makespan minimization

0 references

Scheduling with controllable release dates and processing times: total completion time minimization

0 references

Proportionate flow shop with controllable processing times

0 references

Two-machine open shop problem with controllable processing times

0 references

Batch sizing and job sequencing on a single machine

0 references

A multi-objective approach to resource allocation in single machine scheduling

0 references

Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

0 references

Minimizing Total Tardiness on One Machine is NP-Hard

0 references

Open Shop Scheduling to Minimize Finish Time

0 references

Preemptive Scheduling of Uniform Processor Systems

0 references

A survey of the state-of-the-art of common due date assignment and scheduling research

0 references

Job-shop scheduling with resource-time models of operations

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Heuristics for hybrid flow shops with controllable processing times and assignable due dates

0 references

Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better

0 references

Single-machine scheduling with trade-off between number of tardy jobs and compression cost

0 references

Multicriteria scheduling

0 references

About strongly polynomial time algorithms for quadratic optimization over submodular constraints

0 references

Some comments on sequencing with controllable processing times

0 references

Time-optimal control in a single machine problem with resource constraints

0 references

0 references

0 references

General flow-shop scheduling with resource constraints

0 references

Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem

0 references

0 references

Single machine scheduling problem with a common deadline and resource dependent release dates

0 references

Minimization of the makespan in a two-machine problem under given resource constraints

0 references

Single machine scheduling subject to deadlines and resource dependent processing times

0 references

Positive half-products and scheduling with controllable processing times

0 references

Single machine group scheduling with resource dependent setup and processing times

0 references

0 references

Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations

0 references

Job-shop scheduling with convex models of operations

0 references

Approximation schemes for parallel machine scheduling problems with controllable processing times

0 references

Approximation schemes for job shop scheduling problems with controllable processing times

0 references

0 references

Optimization of the machining economics problem for a multistage transfer machine under failure, opportunistic and integrated replacement strategies

0 references

A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates

0 references

A new bounding mechanism for the CNC machine scheduling problems with controllable processing times

0 references

Completion time variance minimization on a single machine is difficult

0 references

0 references

0 references

Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases

0 references

0 references

A single machine scheduling problem with common due window and controllable processing times

0 references

Notes on max flow time minimization with controllable processing times

0 references

Scheduling with Deadlines and Loss Functions

0 references

Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions

0 references

An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

0 references

Group scheduling with controllable setup and processing times: minimizing total weighted completion time

0 references

Batch scheduling with controllable setup and processing times to minimize total completion time

0 references

Single machine batch scheduling with jointly compressible setup and processing times.

0 references

Single machine scheduling with a variable common due date and resource-dependent processing times.

0 references

Minimizing completion time variance with compressible processing times

0 references

An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times

0 references

A two-machine flow shop scheduling problem with controllable job processing times

0 references

A survey of results for sequencing problems with controllable processing times

0 references

A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

0 references

Single-machine sequencing with controllable processing times

0 references

Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity

0 references

Allocation of resources in project management

0 references

Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine

0 references

Minimizing the total weighted flow time in a single machine with controllable processing times

0 references

Parallel machine scheduling with a convex resource consumption function

0 references

Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function

0 references

Single machine batch scheduling to minimize total completion time and resource consumption costs

0 references

Single machine scheduling with controllable release and processing parameters

0 references

An approximation algorithm for the generalized assignment problem

0 references

Convex quadratic and semidefinite programming relaxations in scheduling

0 references

Scheduling Multiple Variable-Speed Machines

0 references

Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine

0 references

Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.

0 references

Single machine scheduling with resource dependent release times and processing times

0 references

Single machine scheduling problems with controllable processing times and total absolute differences penalties

0 references

A bicriterion approach to time/cost trade-offs in sequencing

0 references

A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

0 references

A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times

0 references

Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.dam.2007.02.003

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2381529

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2381529&oldid=34991411"