Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling
From MaRDI portal
Publication:4849293
DOI10.1057/JORS.1995.105zbMATH Open0833.90072OpenAlexW2073843479MaRDI QIDQ4849293FDOQ4849293
Authors: Wlodzimierz Szwarc, Samar K. Mukhopadhyay 
Publication date: 9 November 1995
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1995.105
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)
- Online Scheduling with Machine Cost and a Quadratic Objective Function
- Title not available (Why is that?)
- Minimizing the total waiting time of intermediate products in a manufacturing process
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
- Stochastic bicriteria single machine scheduling with quadratic cost functions
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
- Title not available (Why is that?)
- Single-machine scheduling problems with precedence constraints and simple linear deterioration
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)
