Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey

scientific article; zbMATH DE number 6680342

Language	Label	Description	Also known as
default for all languages	No label defined
English	Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey	scientific article; zbMATH DE number 6680342

Statements

instance of

scholarly article

0 references

title

Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (English)

0 references

0 references

0 references

0 references

3 February 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4614-1123-9_1

0 references

cites work

Two parallel machine sequencing problems involving controllable job processing times

0 references

Scheduling jobs with fixed start and end times

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Interval scheduling on identical machines

0 references

On the \(k\)-coloring of intervals

0 references

Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

0 references

Maximizing the weighted number of just-in-time jobs in flow shop scheduling

0 references

A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines

0 references

On chain and antichain families of a partially ordered set

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

An efficient algorithm for finding a maximum weight 2-independent set on interval graphs

0 references

Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs

0 references

Q3775317

0 references

Single machine scheduling subject to deadlines and resource dependent processing times

0 references

Resource management in machine scheduling problems: a survey

0 references

Just-in-time scheduling. Models and algorithms for computer and manufacturing systems

0 references

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

0 references

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

0 references

Fixed interval scheduling: models, applications, computational complexity and algorithms

0 references

Single machine scheduling to minimize the number of early and tardy jobs

0 references

Just-in-time scheduling with controllable processing times on parallel machines

0 references

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

0 references

A survey of results for sequencing problems with controllable processing times

0 references

A sequential algorithm for finding a maximum weight<i>K</i>-independent set on interval graphs

0 references

Maximum weight<i>k</i>-independent set problem on permutation graphs

0 references

Maximum \(k\)-covering of weighted transitive graphs with applications

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

A survey of scheduling with controllable processing times

0 references

Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems

0 references

Pre-emptive scheduling problems with controllable processing times

0 references

Finding the largest suborder of fixed width

0 references

Maximizing weighted number of just-in-time jobs on unrelated parallel machines

0 references

Scheduling Multiple Variable-Speed Machines

0 references

The maximum k-colorable subgraph problem for chordal graphs

0 references

Identifiers

zbMATH Open document ID

1355.90029

0 references

DOI

10.1007/978-1-4614-1123-9_1

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey