A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
From MaRDI portal
Publication:2434249
DOI10.1007/s10951-010-0208-7zbMath1280.90071OpenAlexW2029826506MaRDI QIDQ2434249
Publication date: 5 February 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0208-7
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items
A note on resource allocation scheduling with position-dependent workloads, Bicriteria scheduling for due date assignment with total weighted tardiness, Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources, A survey of single machine scheduling to minimize weighted number of tardy jobs, A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity, A new perspective on single-machine scheduling problems with late work related criteria, Single-machine scheduling with machine unavailability periods and resource dependent processing times, Resource constrained scheduling with general truncated job-dependent learning effect, Resource cost aware scheduling, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Pre-emptive scheduling problems with controllable processing times
- A survey of results for sequencing problems with controllable processing times
- Time-optimal control in a single machine problem with resource constraints
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
- Single machine scheduling subject to deadlines and resource dependent processing times
- Minimization of the makespan in a two-machine problem under given resource constraints
- Two parallel machine sequencing problems involving controllable job processing times
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Single machine scheduling with a variable common due date and resource-dependent processing times.
- A permutation flow-shop scheduling problem with convex models of operation processing times
- Some comments on sequencing with controllable processing times
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
- Group scheduling with controllable setup and processing times: minimizing total weighted completion time
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Minimizing the total weighted flow time in a single machine with controllable processing times
- A survey of scheduling with controllable processing times
- Single machine scheduling with controllable release and processing parameters
- Parallel machine scheduling with a convex resource consumption function
- Resource Management in Machine Scheduling Problems: A Survey
- Sequencing with Earliness and Tardiness Penalties: A Review
- General flow-shop scheduling with resource constraints
- Scheduling Multiple Variable-Speed Machines
- Solving a class of two-resource allocation problem by equivalent load method
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Allocation of resources in project management
- Cost-effectiveness of a preventive counseling and support package for postnatal depression
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
