The following pages link to Tapan Sen (Q1115796):
Displayed 14 items.
- The two-machine flowshop scheduling problem with total tardiness (Q1115798) (← links)
- Job lateness in a two-machine flowshop with setup times separated (Q1184446) (← links)
- Job Tardiness in Unequal Parallel Processor Systems (Q3035127) (← links)
- Minimizing the Range of Lateness on a Single Machine (Q3330959) (← links)
- A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure (Q3778533) (← links)
- Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness (Q3779990) (← links)
- On the Single-machine Scheduling Problem with Tardiness Penalties (Q3983490) (← links)
- A bicriterion scheduling problem involving total flowtime and total tardiness (Q4264495) (← links)
- A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness (Q4297161) (← links)
- Minimizing a Quadratic Function of Job Lateness in the Single Machine System (Q4298534) (← links)
- An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system (Q4354087) (← links)
- Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm (Q4469135) (← links)
- Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach (Q4718640) (← links)
- Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure (Q5184654) (← links)