A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
From MaRDI portal
(Redirected from Publication:2434249)
Recommendations
- On bicriteria scheduling of due date assignment and weighted number of tardy jobs
- Bicriteria scheduling for due date assignment with total weighted tardiness
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times
Cites work
- A permutation flow-shop scheduling problem with convex models of operation processing times
- A survey of results for sequencing problems with controllable processing times
- A survey of scheduling with controllable processing times
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Allocation of resources in project management
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Cost-effectiveness of a preventive counseling and support package for postnatal depression
- General flow-shop scheduling with resource constraints
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- scientific article; zbMATH DE number 3976751 (Why is no real title available?)
- scientific article; zbMATH DE number 4035555 (Why is no real title available?)
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
- Minimization of the makespan in a two-machine problem under given resource constraints
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Parallel machine scheduling with a convex resource consumption function
- Pre-emptive scheduling problems with controllable processing times
- Resource management in machine scheduling problems: a survey
- Scheduling Multiple Variable-Speed Machines
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Single machine scheduling subject to deadlines and resource dependent processing times
- Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- Single machine scheduling with controllable release and processing parameters
- Solving a class of two-resource allocation problem by equivalent load method
- Some comments on sequencing with controllable processing times
- Time-optimal control in a single machine problem with resource constraints
- Two parallel machine sequencing problems involving controllable job processing times
Cited in
(18)- Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources
- Resource cost aware scheduling
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
- Single-machine scheduling with machine unavailability periods and resource dependent processing times
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Bicriteria scheduling for due date assignment with total weighted tardiness
- A note on resource allocation scheduling with position-dependent workloads
- Resource constrained scheduling with general truncated job-dependent learning effect
- A bicriteria approach for single machine scheduling with resource allocation, learning effect and a deteriorating maintenance activity
- On bicriteria scheduling of due date assignment and weighted number of tardy jobs
- A new perspective on single-machine scheduling problems with late work related criteria
- Theory and methodology of time-dependent scheduling: past, present and future
- Coordinating scheduling and resource allocation decisions in a proportionate flow-shop scheduling environment
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- A faster algorithm for a due date assignment problem with tardy jobs
This page was built for publication: A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434249)
