A permutation flow-shop scheduling problem with convex models of operation processing times
From MaRDI portal
Publication:1593519
DOI10.1023/A:1018943300630zbMath0997.90035MaRDI QIDQ1593519
Cheng, T. C. Edwin, Adam Janiak
Publication date: 17 January 2001
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018943300630
computational complexity analysis; flow-shop scheduling problem; allocation of a constrained resource; processing order of the jobs
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
Related Items
SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE, Two-machine flow shop scheduling with convex resource consumption functions, A unified approach for scheduling with convex resource consumption functions using positional penalties, Job-shop scheduling with convex models of operations, Single-machine scheduling with resource-dependent processing times and multiple unavailability periods, A survey of scheduling with controllable processing times, A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates, Single-machine group scheduling with deteriorating jobs and allotted resource, Some results of the worst-case analysis for flow shop scheduling with a learning effect, Parallel machine scheduling with a convex resource consumption function, SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN
