Minimizing total weighted completion time in a proportionate flow shop

DOI<157::AID-JOS12>3.0.CO;2-Y 10.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-YzbMath0909.90181OpenAlexW2125181162MaRDI QIDQ1268838

Michael L. Pinedo, Hoogeveen, J. A., Natalia V. Shakhlevich

Publication date: 11 January 1999

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(1998100)1:3<157::aid-jos12>3.0.co;2-y

zbMATH Keywords

weighted completion timeproportionate flow shoppermutation schedulesmachine flow shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Proportionate flow shop games, A general scheme for solving a large set of scheduling problems with rejection in FPT time, Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs, Proportionate flowshop scheduling with position-dependent weights, Minimizing maximum completion time in a proportionate flow shop with one machine of different speed, Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs, The proportionate flow shop total tardiness problem, A survey on offline scheduling with rejection, Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system, Minimizing makespan in an ordered flow shop with machine-dependent processing times, Proportionate Flow Shop Scheduling with Rejection, The just-in-time scheduling problem in a flow-shop scheduling system, A note on makespan minimization in proportionate flow shops, On the complexity of proportionate open shop and job shop problems, Two-stage proportionate flexible flow shop to minimize the makespan, Proportionate flow shop with controllable processing times, A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop, A note: minimizing maximum earliness on a proportionate flowshop, Scheduling Problems over Network of Machines, Approximation Algorithms for Generalized Path Scheduling, Flow shops with machine maintenance: ordered and proportionate cases, Scheduling problems over a network of machines, Flow shops with reentry: reversibility properties and makespan optimal schedules, Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times, Shop scheduling problems with pliable jobs, The three-machine proportionate flow shop problem with unequal machine speeds, Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds, Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates, Proportionate flow shop: New complexity results and models with due date assignment, Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs