P. C. Bagga

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q3088470	2011-08-19	Paper
Flowshop/no-idle scheduling to minimise the mean flowtime	2006-01-23	Paper
Flowshop/no-idle scheduling to minimize total elapsed time	2006-01-23	Paper
Bicriteria in a two-stage flowshop scheduling problem.	2004-02-18	Paper
Minimizing total elapsed time subject to zero total idle time of machines in \(n\times 3\) flowshop problem.	2003-10-23	Paper
Bicriteria in special flowshop problems	2002-08-21	Paper
Special class of flowshop sequencing problems	2002-04-21	Paper
https://portal.mardi4nfdi.de/entity/Q4227912	1999-02-02	Paper
Sequencing with restrictions in processing times	1998-08-02	Paper
Minimizing Mean Completion Time for Special Flowshop Problems	1997-06-16	Paper
https://portal.mardi4nfdi.de/entity/Q4338563	1997-05-28	Paper
Scheduling of job-block with dead line in n\(\times 2\) flowshop problem with separated set up times	1985-01-01	Paper
Special Cases With Set Up Considerations for n×3 Flowshop Problem	1985-01-01	Paper
Minimizing the makespan in a 2-machine flowshop with time lags and setup conditions	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3321816	1984-01-01	Paper
Optimal Algorithms for Job-Blocks in 2 × n Sequencing Problem with Transportation Times—A Computational Comparison	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3343752	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3040915	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3332756	1983-01-01	Paper
Node elimination in three-machine flowshop scheduling problem	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3037111	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3315255	1982-01-01	Paper
The Sngle Machine Problem with Quadratic Penalty Function	1982-01-01	Paper
Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach	1981-01-01	Paper
Flow-Shop Sequencing with no Intratnachine Waiting: Minimization of Total Waiting Cost	1981-01-01	Paper
Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3858001	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3887201	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3901285	1979-01-01	Paper
A note on equivalent jobs for job blocks in job sequencing problems	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4143000	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4146533	1976-01-01	Paper
Two machine scheduling problem when passing allowed	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3212920	1973-01-01	Paper
Sequencing with Random Service Times	1970-01-01	Paper
Two stage production schedule	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4772954	1969-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5545165	1968-01-01	Paper

Research outcomes over time

This page was built for person: P. C. Bagga