Scheduling to minimize the total compression and late costs
From MaRDI portal
Publication:4381876
DOI<67::AID-NAV4>3.0.CO;2-J 10.1002/(SICI)1520-6750(199802)45:1<67::AID-NAV4>3.0.CO;2-JzbMath0897.90125OpenAlexW2047580817MaRDI QIDQ4381876
Chung-Lun Li, Cheng, T. C. Edwin, Bertrand M. T. Lin, Zhi-Long Chen
Publication date: 25 March 1998
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199802)45:1<67::aid-nav4>3.0.co;2-j
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items
A survey of scheduling with controllable processing times ⋮ Inverse interval scheduling via reduction on a single machine ⋮ Single machine scheduling with discretely controllable processing times ⋮ Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Single machine batch scheduling with jointly compressible setup and processing times. ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ Approximation schemes for job shop scheduling problems with controllable processing times ⋮ Single machine group scheduling with resource dependent setup and processing times ⋮ Group scheduling with controllable setup and processing times: minimizing total weighted completion time ⋮ Single machine batch scheduling with resource dependent setup and processing times ⋮ Single CNC machine scheduling with controllable processing times and multiple due dates ⋮ Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs ⋮ Single–machine scheduling with random machine breakdowns and randomly compressible processing times
