Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling
From MaRDI portal
(Redirected from Publication:4849293)
Recommendations
- scientific article; zbMATH DE number 4049369
- scientific article; zbMATH DE number 830014
- Minimising a weighted quadratic function of job lateness in the stochastic single machine scheduling problem
- Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
Cited in
(10)- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
- Single-machine scheduling problems with precedence constraints and simple linear deterioration
- Stochastic bicriteria single machine scheduling with quadratic cost functions
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Online scheduling with machine cost and a quadratic objective function
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
- scientific article; zbMATH DE number 4049369 (Why is no real title available?)
- scientific article; zbMATH DE number 830014 (Why is no real title available?)
- Minimizing the total waiting time of intermediate products in a manufacturing process
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
This page was built for publication: Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4849293)