A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249): Difference between revisions

Latest revision as of 08:30, 7 July 2024

scientific article

Language	Label	Description	Also known as
English	A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates	scientific article

Statements

instance of

scholarly article

0 references

title

A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (English)

0 references

zbMATH Open document ID

1280.90071

0 references

DOI

10.1007/s10951-010-0208-7

0 references

0 references

0 references

Journal of Scheduling

0 references

publication date

5 February 2014

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

bicriteria scheduling

0 references

due date assignment

0 references

convex controllable processing times

0 references

resource allocation

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10951-010-0208-7

0 references

OpenAlex ID

W2029826506

0 references

cites work

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

Two parallel machine sequencing problems involving controllable job processing times

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

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

Some comments on sequencing with controllable processing times

0 references

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

0 references

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

0 references

Q3741388

0 references

Q3775317

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

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

Resource Management in Machine Scheduling Problems: A Survey

0 references

Parallel machine scheduling to minimize costs for earliness and number of tardy jobs

0 references

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

0 references

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

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

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

A survey of scheduling with controllable processing times

0 references

Pre-emptive scheduling problems with controllable processing times

0 references

Single machine scheduling with controllable release and processing parameters

0 references

Manufacturing lead-time rules: customer retention versus tardiness costs

0 references

Scheduling Multiple Variable-Speed Machines

0 references

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

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2434249

@@ Property / author @@
-George Steiner
@@ Property / author: George Steiner / rank @@
-Normal rank
@@ Property / author @@
+George Steiner
@@ Property / author: George Steiner / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10951-010-0208-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2029826506
@@ Property / OpenAlex ID: W2029826506 / rank @@
+Normal rank
@@ Property / cites work @@
+Cost-effectiveness of a preventive counseling and support package for postnatal depression
+Normal rank
@@ Property / cites work @@
+Solving a class of two-resource allocation problem by equivalent load method
+Normal rank
@@ Property / cites work @@
+Two parallel machine sequencing problems involving controllable job processing times
+Normal rank
@@ Property / cites work @@
+Sequencing with Earliness and Tardiness Penalties: A Review
+Normal rank
@@ Property / cites work @@
+A permutation flow-shop scheduling problem with convex models of operation processing times
+Normal rank
@@ Property / cites work @@
+Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
+Normal rank
@@ Property / cites work @@
+Some comments on sequencing with controllable processing times
+Normal rank
@@ Property / cites work @@
+A survey of the state-of-the-art of common due date assignment and scheduling research
+Normal rank
@@ Property / cites work @@
+Time-optimal control in a single machine problem with resource constraints
+Normal rank
@@ Property / cites work @@
+Q3741388
@@ Property / cites work: Q3741388 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3775317
@@ Property / cites work: Q3775317 / rank @@
+Normal rank
@@ Property / cites work @@
+General flow-shop scheduling with resource constraints
+Normal rank
@@ Property / cites work @@
+Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
+Normal rank
@@ Property / cites work @@
+Minimization of the makespan in a two-machine problem under given resource constraints
+Normal rank
@@ Property / cites work @@
+Single machine scheduling subject to deadlines and resource dependent processing times
+Normal rank
@@ Property / cites work @@
+Resource Management in Machine Scheduling Problems: A Survey
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
+Normal rank
@@ Property / cites work @@
+Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with a variable common due date and resource-dependent processing times.
+Normal rank
@@ Property / cites work @@
+Group scheduling with controllable setup and processing times: minimizing total weighted completion time
+Normal rank
@@ Property / cites work @@
+A survey of results for sequencing problems with controllable processing times
+Normal rank
@@ Property / cites work @@
+Allocation of resources in project management
@@ Property / cites work: Allocation of resources in project management / rank @@
+Normal rank
@@ Property / cites work @@
+Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
+Normal rank
@@ Property / cites work @@
+Minimizing the total weighted flow time in a single machine with controllable processing times
+Normal rank
@@ Property / cites work @@
+Parallel machine scheduling with a convex resource consumption function
+Normal rank
@@ Property / cites work @@
+A survey of scheduling with controllable processing times
+Normal rank
@@ Property / cites work @@
+Pre-emptive scheduling problems with controllable processing times
+Normal rank
@@ Property / cites work @@
+Single machine scheduling with controllable release and processing parameters
+Normal rank
@@ Property / cites work @@
+Manufacturing lead-time rules: customer retention versus tardiness costs
+Normal rank
@@ Property / cites work @@
+Scheduling Multiple Variable-Speed Machines
@@ Property / cites work: Scheduling Multiple Variable-Speed Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
+Normal rank