UB Paderborn / Katalog / Suche / in CDI

Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems

Operations research, 1989-01, Vol.37 (1), p.118-125

Bagchi, Uttarayan

1989

Volltextzugriff (PDF)

On static stochastic order crossover

International journal of production economics, 2008-07, Vol.114 (1), p.404-413

2008

Volltextzugriff (PDF)

Cost relationships in stochastic inventory systems: A simulation study of the ( S, S−1, t=1) model

International journal of production economics, 2011-04, Vol.130 (2), p.196-202

2011

Volltextzugriff (PDF)

Coordinated scheduling of customer orders for quick response

Naval research logistics, 2005-09, Vol.52 (6), p.493-512

2005

Volltextzugriff (PDF)

Minimizing Mean Squared Deviation of Completion Times About a Common Due Date

Management science, 1987-07, Vol.33 (7), p.894-906

1987

Volltextzugriff (PDF)

Modeling lead-time demand for lumpy demand and variable lead time

Naval research logistics, 1987-10, Vol.34 (5), p.687-704

Bagchi, Uttarayan

1987

Volltextzugriff (PDF)

Lower bounds for single-machine scheduling problems

Naval research logistics, 1990-12, Vol.37 (6), p.967-979

1990

Volltextzugriff (PDF)

Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date

Naval research logistics, 1987-10, Vol.34 (5), p.739-751

1987

Volltextzugriff (PDF)

The effect of lead-time variability: The case of independent demand

Journal of operations management, 1986-02, Vol.6 (2), p.159-177

1986

Volltextzugriff (PDF)

An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines

Operations research, 1987-03, Vol.35 (2), p.311-313

1987

Volltextzugriff (PDF)

Delivering student satisfaction in higher education: A QFD approach

2010 7th International Conference on Service Systems and Service Management, 2010, p.1-4

Bagchi, U

2010

Volltextzugriff (PDF)

Simultaneous Minimization Of Mean And Variation Of Flow Tim

Operations research, 1989-01, Vol.37 (1), p.118

Bagchi, Uttarayan

1989

Volltextzugriff (PDF)

Technical Note--A Note on Linearly Decreasing, Delay-Dependent Non-Preemptive Queue Disciplines

Operations research, 1984-08, Vol.32 (4), p.952-957

Bagchi, Uttarayan

1984

Volltextzugriff (PDF)

Effect of increasing component commonality on service level and holding cost

Naval research logistics, 1992-10, Vol.39 (6), p.815-832

1992

Volltextzugriff (PDF)

Due-Date Assignment to Multi-Job Customer Orders

Management science, 1994-10, Vol.40 (10), p.1389-1392

1994

Volltextzugriff (PDF)

A Note on Linearly Decreasing, Delay-Dependent Non-Preemptive Queue Disciplines

Operations research, 1984-07, Vol.32 (4), p.952-957

Bagchi, Uttarayan

1984

Volltextzugriff (PDF)

Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop

European journal of operational research, 1990-02, Vol.44 (3), p.331-336

1990

Volltextzugriff (PDF)

Minimizing mean absolute deviation of completion times about a common due date

Naval research logistics quarterly, 1986-05, Vol.33 (2), p.227-240

1986

Volltextzugriff (PDF)

Note: Due-date Assignment to Multi-Job Customer Orders

Management science, 1994-10, Vol.40 (10), p.1389-1392

1994

Volltextzugriff (PDF)

Minimizing Job Idleness in Deadline Constrained Environments

Operations research, 1992-09, Vol.40 (5), p.972-985

1992

Volltextzugriff (PDF)

ON THE DISTRIBUTION OF DEMAND DURING LEAD TIME

BAGCHI, UTTARAYAN

1982

Volltextzugriff (PDF)

Demand during Lead Time for Normal Unit Demand and Erlang Lead Time

The Journal of the Operational Research Society, 1984-02, Vol.35 (2), p.131

1984

Volltextzugriff (PDF)

Minimizing mean squared deviation of completion tables times about a common due date

Management science, 1987-07, Vol.33 (7), p.894-906

1987

Volltextzugriff (PDF)

Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function

Operations research, 1985-11, Vol.33 (6), p.1278-1298

1985

Volltextzugriff (PDF)

Technical Note--An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines

Operations research, 1987-04, Vol.35 (2), p.311-313

1987

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems

On static stochastic order crossover

Cost relationships in stochastic inventory systems: A simulation study of the ( S, S−1, t=1) model

Coordinated scheduling of customer orders for quick response

Minimizing Mean Squared Deviation of Completion Times About a Common Due Date

Modeling lead-time demand for lumpy demand and variable lead time

Lower bounds for single-machine scheduling problems

Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date

The effect of lead-time variability: The case of independent demand

An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines

Delivering student satisfaction in higher education: A QFD approach

Simultaneous Minimization Of Mean And Variation Of Flow Tim

Technical Note--A Note on Linearly Decreasing, Delay-Dependent Non-Preemptive Queue Disciplines

Effect of increasing component commonality on service level and holding cost

Due-Date Assignment to Multi-Job Customer Orders

A Note on Linearly Decreasing, Delay-Dependent Non-Preemptive Queue Disciplines

Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop

Minimizing mean absolute deviation of completion times about a common due date

Note: Due-date Assignment to Multi-Job Customer Orders

Minimizing Job Idleness in Deadline Constrained Environments

ON THE DISTRIBUTION OF DEMAND DURING LEAD TIME

Demand during Lead Time for Normal Unit Demand and Erlang Lead Time

Minimizing mean squared deviation of completion tables times about a common due date

Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function

Technical Note--An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines

Suchergebnisse filtern